Pages that link to "Item:Q639650"

The following pages link to The provably total NP search problems of weak second order bounded arithmetic (Q639650):

Displayed 4 items.

• Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) ‎ (← links)
• Bounded theories for polyspace computability (Q2450770) ‎ (← links)
• FRAGMENTS OF APPROXIMATE COUNTING (Q2921008) ‎ (← links)
• Improved witnessing and local improvement principles for second-order bounded arithmetic (Q5410329) ‎ (← links)