Pages that link to "Item:Q837177"
From MaRDI portal
The following pages link to Nondeterministic functions and the existence of optimal proof systems (Q837177):
Displaying 8 items.
- Total nondeterministic Turing machines and a p-optimal proof system for SAT (Q2011675) (← links)
- Further oracles separating conjectures about incompleteness in the finite domain (Q2210516) (← links)
- An oracle separating conjectures about incompleteness in the finite domain (Q2290649) (← links)
- Do there exist complete sets for promise classes? (Q3107337) (← links)
- Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes (Q3392941) (← links)
- Soft Subdivision Search in Motion Planning, II: Axiomatics (Q3452548) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
- P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle (Q5092409) (← links)
