Pages that link to "Item:Q3018648"
From MaRDI portal
The following pages link to The provably total search problems of bounded arithmetic (Q3018648):
Displaying 20 items.
- The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
- A note on propositional proof complexity of some Ramsey-type statements (Q627444) (← 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)
- Alternating minima and maxima, Nash equilibria and bounded arithmetic (Q764279) (← links)
- On the complexity of finding falsifying assignments for Herbrand disjunctions (Q892133) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- The canonical pairs of bounded depth Frege systems (Q2216035) (← links)
- Induction rules in bounded arithmetic (Q2309507) (← links)
- Random resolution refutations (Q2311546) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- FRAGMENTS OF APPROXIMATE COUNTING (Q2921008) (← links)
- A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
- Short refutations for an equivalence‐chain principle for constant‐depth formulas (Q5109242) (← links)
- Parity Games and Propositional Proofs (Q5169973) (← links)
- The NP Search Problems of Frege and Extended Frege Proofs (Q5278209) (← links)
- Improved witnessing and local improvement principles for second-order bounded arithmetic (Q5410329) (← links)
- Mining the surface: witnessing the low complexity theorems of arithmetic (Q6160756) (← links)