The following pages link to (Q4856172):
Displaying 50 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Relativizing small complexity classes and their theories (Q260396) (← links)
- Proof complexity of intuitionistic implicational formulas (Q331054) (← links)
- Division by zero (Q335000) (← links)
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- Parameterized proof complexity (Q451111) (← links)
- Circuit lower bounds in bounded arithmetics (Q466447) (← links)
- Lifting lower bounds for tree-like proofs (Q475337) (← links)
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- Construction of models of bounded arithmetic by restricted reduced powers (Q506954) (← links)
- Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) (Q535152) (← links)
- Preservation theorems and restricted consistency statements in bounded arithmetic (Q598285) (← links)
- A note on propositional proof complexity of some Ramsey-type statements (Q627444) (← links)
- The strength of sharply bounded induction requires MSP (Q636290) (← links)
- On the computational complexity of cut-reduction (Q636310) (← links)
- On theories of bounded arithmetic for \(\mathrm{NC}^1\) (Q638497) (← links)
- The provably total NP search problems of weak second order bounded arithmetic (Q639650) (← links)
- Introduction to clarithmetic. I (Q642523) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- Proof complexity of propositional default logic (Q647339) (← links)
- Independence results for variants of sharply bounded induction (Q716498) (← links)
- Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem (Q731897) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- Alternating minima and maxima, Nash equilibria and bounded arithmetic (Q764279) (← links)
- The equivalence of theories that characterize ALogTime (Q834715) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic (Q866557) (← links)
- Preservation theorems for bounded formulas (Q866887) (← links)
- Passive induction and a solution to a Paris-Wilkie open question (Q882120) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- Generalized quantifier and a bounded arithmetic theory for LOGCFL (Q884960) (← links)
- Integer factoring and modular square roots (Q896029) (← links)
- Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
- Feasible operations on proofs: the logic of proofs for bounded arithmetic (Q929293) (← links)
- The deduction theorem for strong propositional proof systems (Q987382) (← links)
- Quantum deduction rules (Q1001909) (← links)
- Substitution Frege and extended Frege proof systems in non-classical logics (Q1023047) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- \(\text{Count}(q)\) does not imply \(\text{Count}(p)\) (Q1377601) (← links)
- End extensions of models of linearly bounded arithmetic (Q1377910) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
- Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms (Q1401230) (← links)
- On reducibility and symmetry of disjoint NP pairs. (Q1401249) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
