Pages that link to "Item:Q639650"
From MaRDI portal
The following pages link to The provably total NP search problems of weak second order bounded arithmetic (Q639650):
Displaying 14 items.
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- The canonical pairs of bounded depth Frege systems (Q2216035) (← links)
- Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) (← links)
- Bounded theories for polyspace computability (Q2450770) (← links)
- FRAGMENTS OF APPROXIMATE COUNTING (Q2921008) (← links)
- QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS (Q3188337) (← links)
- Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
- Approximate counting and NP search problems (Q5055313) (← 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)
- CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS (Q5739904) (← links)
- Witnessing flows in arithmetic (Q6646013) (← links)
