The following pages link to (Q4251070):
Displaying 20 items.
- On an optimal randomized acceptor for graph nonisomorphism (Q413276) (← links)
- Consistency, optimality, and incompleteness (Q490660) (← links)
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Optimal deterministic algorithm generation (Q1668803) (← links)
- Efficient rational proofs for space bounded computations (Q1675446) (← links)
- On an optimal propositional proof system and the structure of easy subsets of TAUT. (Q1853507) (← links)
- Optimal heuristic algorithms for the image of an injective function (Q1946839) (← links)
- Total nondeterministic Turing machines and a p-optimal proof system for SAT (Q2011675) (← links)
- Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284) (← links)
- Optimal Proximity Proofs Revisited (Q2794513) (← links)
- On optimal inverters (Q2925321) (← links)
- Consistency and Optimality (Q3091441) (← links)
- (Q3113771) (← links)
- (Q4281686) (← links)
- (Q4440437) (← links)
- OPTIMAL PROOFS OF DETERMINACY II (Q4799378) (← links)
- Semialgebraic Proofs and Efficient Algorithm Design (Q5215904) (← links)
- (Q5422270) (← links)
- Hard Instances of Algorithms and Proof Systems (Q5892128) (← links)