On an optimal deterministic algorithm for SAT
From MaRDI portal
Recommendations
Cited in
(17)- On the greedy algorithm for satisfiability
- Optimal deterministic algorithm generation
- Optimal heuristic algorithms for the image of an injective function
- Total nondeterministic Turing machines and a p-optimal proof system for SAT
- The SAT+CAS method for combinatorial search with applications to best matrices
- An enumerative algorithm for \#2SAT
- scientific article; zbMATH DE number 5914170 (Why is no real title available?)
- Optimal acceptors and optimal proof systems
- On slicewise monotone parameterized problems and optimal proof systems for TAUT
- On an optimal randomized acceptor for graph nonisomorphism
- scientific article; zbMATH DE number 1182571 (Why is no real title available?)
- scientific article; zbMATH DE number 2080216 (Why is no real title available?)
- scientific article; zbMATH DE number 6874827 (Why is no real title available?)
- STACS 2004
- Hard instances of algorithms and proof systems
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
- Nondeterministic functions and the existence of optimal proof systems
This page was built for publication: On an optimal deterministic algorithm for SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263798)