Pages that link to "Item:Q1383164"
From MaRDI portal
The following pages link to Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164):
Displayed 33 items.
- Interpolation systems for ground proofs in automated deduction: a survey (Q287275) (← links)
- Extended clause learning (Q622116) (← links)
- Mean-payoff games and propositional proofs (Q716324) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
- Quantum deduction rules (Q1001909) (← links)
- On reducibility and symmetry of disjoint NP pairs. (Q1401249) (← links)
- Non-standard finite fields over \(I\Delta_0+\Omega_1\) (Q1567349) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- A model-theoretic characterization of the weak pigeonhole principle (Q1849868) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- Dual weak pigeonhole principle, Boolean complexity, and derandomization (Q1887654) (← links)
- How QBF expansion makes strategy extraction hard (Q2096438) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- Tautologies from Pseudo-Random Generators (Q2736584) (← links)
- ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← 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)
- Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
- The polynomial and linear hierarchies in models where the weak pigeonhole principle fails (Q3503756) (← links)
- Abelian groups and quadratic residues in weak arithmetic (Q3566945) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Towards a Unified Complexity Theory of Total Functions (Q4993302) (← links)
- INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH (Q5082067) (← links)
- Short Proofs Are Hard to Find (Q5091243) (← links)
- Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds (Q5311724) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)