Pages that link to "Item:Q1853507"
From MaRDI portal
The following pages link to On an optimal propositional proof system and the structure of easy subsets of TAUT. (Q1853507):
Displaying 13 items.
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- The deduction theorem for strong propositional proof systems (Q987382) (← links)
- Reductions between disjoint NP-pairs (Q2387199) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- ON OPTIMAL INVERTERS (Q2925321) (← links)
- Consistency and Optimality (Q3091441) (← 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)
- Logical Closure Properties of Propositional Proof Systems (Q3502657) (← links)
- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (Q3540180) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- The Deduction Theorem for Strong Propositional Proof Systems (Q5458838) (← links)
- Hard Instances of Algorithms and Proof Systems (Q5892128) (← links)
