Pages that link to "Item:Q1273858"
From MaRDI portal
The following pages link to The relative complexity of NP search problems (Q1273858):
Displayed 8 items.
- Propositional proofs and reductions between NP search problems (Q435190) (← 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)
- Alternating minima and maxima, Nash equilibria and bounded arithmetic (Q764279) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- A Sperner lemma complete for PPA (Q1603412) (← links)
- Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481) (← links)