The following pages link to (Q4133141):
Displaying 50 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- Circuit lower bounds in bounded arithmetics (Q466447) (← links)
- On the complexity of cutting-plane proofs (Q580175) (← links)
- The provably total NP search problems of weak second order bounded arithmetic (Q639650) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- On the complexity of finding falsifying assignments for Herbrand disjunctions (Q892133) (← links)
- Propositional consistency proofs (Q1177033) (← links)
- Bounded arithmetic and the polynomial hierarchy (Q1177041) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- Intuitionistic propositional logic is polynomial-space complete (Q1259589) (← links)
- The complexity of Gentzen systems for propositional logic (Q1263584) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- ALOGTIME and a conjecture of S. A. Cook (Q1353980) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Automated higher-order complexity analysis (Q1827392) (← links)
- The proof complexity of linear algebra (Q1886325) (← links)
- Dual weak pigeonhole principle, Boolean complexity, and derandomization (Q1887654) (← links)
- Unprovability of consistency statements in fragments of bounded arithmetic (Q1896613) (← links)
- A bounded arithmetic AID for Frege systems (Q1977488) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- The canonical pairs of bounded depth Frege systems (Q2216035) (← links)
- Polynomial time ultrapowers and the consistency of circuit lower bounds (Q2288334) (← links)
- Induction rules in bounded arithmetic (Q2309507) (← links)
- Hardness assumptions in the foundations of theoretical computer science (Q2388429) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- Unprovability of circuit upper bounds in Cook's theory PV (Q2980966) (← 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)
- Dynamic Symmetry Breaking by Simulating Zykov Contraction (Q3637171) (← links)
- STRICT FINITISM, FEASIBILITY, AND THE SORITES (Q4577997) (← links)
- Expander Construction in VNC1 (Q4638081) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
- CONSISTENCY PROOF OF A FRAGMENT OF PV WITH SUBSTITUTION IN BOUNDED ARITHMETIC (Q4692080) (← links)
- (Q4989407) (← links)
- Substitution and Propositional Proof Complexity (Q5027247) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
