The following pages link to (Q5306365):
Displayed 50 items.
- Total maps of Turing categories (Q283751) (← links)
- Reverse complexity (Q287279) (← links)
- Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems (Q306491) (← links)
- Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication'' (Q386053) (← links)
- Characteristic set algorithms for equation solving in finite fields (Q413410) (← links)
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- Circuit lower bounds in bounded arithmetics (Q466447) (← links)
- Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) (Q535152) (← links)
- Observations on complete sets between linear time and polynomial time (Q627129) (← 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)
- The strength of extensionality. II: Weak weak set theories without infinity (Q639665) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- Independence results for variants of sharply bounded induction (Q716498) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- Real closures of models of weak arithmetic (Q1935370) (← links)
- Lower bound techniques for QBF expansion (Q1987510) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Building strategies into QBF proofs (Q2031411) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- From QBFs to \textsf{MALL} and back via focussing (Q2209553) (← links)
- On the efficiency of solving Boolean polynomial systems with the characteristic set method (Q2211189) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- A formal framework for stringology (Q2295636) (← links)
- Induction rules in bounded arithmetic (Q2309507) (← links)
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) (Q2339958) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) (Q2700809) (← links)
- A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- (Q3304106) (← links)
- A form of feasible interpolation for constant depth Frege systems (Q3570172) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- STRICT FINITISM, FEASIBILITY, AND THE SORITES (Q4577997) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- Expander Construction in VNC1 (Q4638081) (← links)
- Simulation of Natural Deduction and Gentzen Sequent Calculus (Q4683217) (← links)
- Rethinking Defeasible Reasoning: A Scalable Approach (Q4957204) (← links)
- (Q4993272) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)
- (Q5090460) (← links)
- On the finite axiomatizability of (Q5109206) (← links)
- (Q5136303) (← links)
- (Q5208872) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)