Pages that link to "Item:Q5294030"
From MaRDI portal
The following pages link to NP search problems in low fragments of bounded arithmetic (Q5294030):
Displayed 18 items.
- Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) (Q535152) (← links)
- Nested PLS (Q535153) (← 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)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- Random resolution refutations (Q2311546) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC (Q3583040) (← links)
- Examining Fragments of the Quantified Propositional Calculus (Q3617380) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
- (Q5092398) (← links)
- Parity Games and Propositional Proofs (Q5169973) (← links)
- The NP Search Problems of Frege and Extended Frege Proofs (Q5278209) (← links)
- Mining the surface: witnessing the low complexity theorems of arithmetic (Q6160756) (← links)