scientific article; zbMATH DE number 5201477
From MaRDI portal
Publication:5422270
zbMath1127.03043MaRDI QIDQ5422270
Publication date: 17 October 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items (5)
Nondeterministic functions and the existence of optimal proof systems ⋮ Logical Closure Properties of Propositional Proof Systems ⋮ Towards NP-P via proof complexity and search ⋮ Proof system representations of degrees of disjoint NP-pairs ⋮ Hard Instances of Algorithms and Proof Systems
This page was built for publication: