Publication:5422270
From MaRDI portal
zbMath1127.03043MaRDI QIDQ5422270
Publication date: 17 October 2007
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
03F20: Complexity of proofs
Related Items
Hard Instances of Algorithms and Proof Systems, Towards NP-P via proof complexity and search, Nondeterministic functions and the existence of optimal proof systems, Proof system representations of degrees of disjoint NP-pairs, Logical Closure Properties of Propositional Proof Systems