Pages that link to "Item:Q1401249"
From MaRDI portal
The following pages link to On reducibility and symmetry of disjoint NP pairs. (Q1401249):
Displaying 19 items.
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058) (← links)
- Mean-payoff games and propositional proofs (Q716324) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Canonical disjoint NP-pairs of propositional proof systems (Q868942) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
- The deduction theorem for strong propositional proof systems (Q987382) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- Proof system representations of degrees of disjoint NP-pairs (Q1944897) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- On the proof complexity of logics of bounded branching (Q2084964) (← links)
- The canonical pairs of bounded depth Frege systems (Q2216035) (← links)
- Logical Closure Properties of Propositional Proof Systems (Q3502657) (← links)
- THE INFORMATIONAL CONTENT OF CANONICAL DISJOINT NP-PAIRS (Q3636159) (← links)
- (Q4989407) (← links)
- (Q5092398) (← links)
- Finding the Hardest Formulas for Resolution (Q5154766) (← links)
- Parity Games and Propositional Proofs (Q5169973) (← links)
- The Deduction Theorem for Strong Propositional Proof Systems (Q5458838) (← links)
