Pages that link to "Item:Q868942"
From MaRDI portal
The following pages link to Canonical disjoint NP-pairs of propositional proof systems (Q868942):
Displaying 15 items.
- A thirty year old conjecture about promise problems (Q347124) (← links)
- Inseparability and strong hypotheses for disjoint NP pairs (Q693061) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- The deduction theorem for strong propositional proof systems (Q987382) (← links)
- Proof system representations of degrees of disjoint NP-pairs (Q1944897) (← links)
- Do there exist complete sets for promise classes? (Q3107337) (← links)
- Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes (Q3392941) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
- The Deduction Theorem for Strong Propositional Proof Systems (Q5458838) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465846) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492875) (← links)
- Unions of Disjoint NP-Complete Sets (Q5892145) (← links)
- Theory and Applications of Models of Computation (Q5898879) (← links)
- Dimension and the structure of complexity classes (Q6109065) (← links)