Jan Krajíček – författare
Visar alla böcker från författaren Jan Krajíček. Handla med fri frakt och snabb leverans.
3 produkter
Forcing with Random Variables and Proof Complexity
Häftad, 2010
976 kr
Lägg i varukorg
This book introduces a new approach to building models of bounded arithmetic, with techniques drawn from recent results in computational complexity. Propositional proof systems and bounded arithmetics are closely related. In particular, proving lower bounds on the lengths of proofs in propositional …
Proof Complexity Generators
Häftad, 2025
656 kr
Lägg i varukorg
The P vs. NP problem is one of the fundamental problems of mathematics. It asks whether propositional tautologies can be recognized by a polynomial-time algorithm. The problem would be solved in the negative if one could show that there are propositional tautologies that are very hard to prove, no …
Proof Complexity
Inbunden, 2019
2410 kr
Lägg i varukorg
Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a …
