The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Computing Stable Models: Worst-Case Performance Estimates
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
New Algorithms for k -SAT Based on the Local Search Principle
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Upper Bounds for MaxSat: Further Improved
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Probabilistic 3-SAT Algorithm Further Improved
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Exploiting Partial Knowledge of Satisfying Assignments
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
A Space-Efficient Randomized DNA Algorithm for k-SAT
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Conditional Pure Literal Graphs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Exploiting partial knowledge of satisfying assignments
Discrete Applied Mathematics
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Journal of Computer and System Sciences
Present and Future of Practical SAT Solving
Complexity of Constraints
3-coloring in time O (1.3289n)
Journal of Algorithms
ACM Transactions on Computation Theory (TOCT)
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A CNF formula hierarchy over the hypercube
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
A decision-making procedure for resolution-based SAT-solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Searching for autarkies to trim unsatisfiable clause sets
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A CNF class generalizing exact linear formulas
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Guided search and a faster deterministic algorithm for 3-SAT
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Improving efficiency of 3-SAT-solving tile systems
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
An exact algorithm for the Boolean connectivity problem for k-CNF
Theoretical Computer Science
Derandomizing HSSW algorithm for 3-SAT
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A new bound for 3-satisfiable maxsat and its algorithmic application
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
A satisfiability algorithm for AC0
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Algorithms for satisfiability using independent sets of variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
An improved Õ(1.234m)-time deterministic algorithm for SAT
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Resolution tunnels for improved SAT solver performance
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Algorithmics in exponential time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithmics – is there hope for a unified theory?
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
An exact algorithm for the boolean connectivity problem for k-CNF
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
An efficient algorithm for the 3-satisfiability problem
Operations Research Letters
A general method for deciding about logically constrained issues
Annals of Mathematics and Artificial Intelligence
Efficient 3-SAT algorithms in the tile assembly model
Natural Computing: an international journal
Fixed-parameter tractability of satisfying beyond the number of variables
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Fast approximation algorithms for the diameter and radius of sparse graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A new bound for 3-satisfiable MaxSat and its algorithmic application
Information and Computation
| Hi-index | 0.05 |
In this paper we describe and analyse an algorithm for solving the satisfiability problem. If E is a boolean formula in conjunctive normal form with n variables and r clauses, then we will show that this algorithm solves the satisfiability problem for formulas with at most k literals per clause in time O(|F|.@a"k^n), where @a"k is the greatest number satisfying @a"k = 2-1/@a"k^k^-^1 (in the case of 3-satisfiability @a"3 = 1,6181).