scientific article; zbMATH DE number 1834681
From MaRDI portal
Publication:4779177
zbMath0999.68080MaRDI QIDQ4779177
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360621
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other degrees and reducibilities in computability and recursion theory (03D30) Complexity of proofs (03F20)
Related Items (6)
On the automatizability of resolution and related propositional proof systems ⋮ Reductions between disjoint NP-pairs ⋮ A thirty year old conjecture about promise problems ⋮ Canonical disjoint NP-pairs of propositional proof systems ⋮ The Shrinking Property for NP and coNP ⋮ The shrinking property for NP and coNP
This page was built for publication:
