A satisfiability tester for non-clausal propositional calculus
Information and Computation
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Investigations on autark assignments
Discrete Applied Mathematics - Special issue on Boolean functions and related problems
SAT Local Search Algorithms: Worst-Case Study
Journal of Automated Reasoning
Local Search Algorithms for SAT: Worst-Case Analysis
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Solving 3-Satisfiability in Less Then 1, 579n Steps
CSL '92 Selected Papers from the Workshop on Computer Science Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Algorithms for quantified Boolean formulas
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
ISAAC '00 Proceedings of the 11th International Conference 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
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
Discrete Applied Mathematics - The renesse issue on satisfiability
Annals of Mathematics and Artificial Intelligence
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms
An improved exponential-time algorithm for k-SAT
Journal of the ACM (JACM)
Improving exact algorithms for MAX-2-SAT
Annals of Mathematics and Artificial Intelligence
An algorithm for exact satisfiability analysed with the number of clauses as parameter
Information Processing Letters
An improved exact algorithm for the domatic number problem
Information Processing Letters
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
Journal of Discrete Algorithms
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Study of lower bound functions for MAX-2-SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
An Improved SAT Algorithm in Terms of Formula Length
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
An algorithm for Exact Satisfiability analysed with the number of clauses as parameter
Information Processing Letters
A tighter upper bound for random MAX 2-SAT
Information Processing Letters
Derandomization of schuler’s algorithm for SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
NiVER: non-increasing variable elimination resolution for preprocessing SAT instances
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
An algorithm for the SAT problem for formulae of linear length
ESA'05 Proceedings of the 13th annual European conference on Algorithms
An improved Õ(1.234m)-time deterministic algorithm for SAT
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Faster exact solving of SAT formulae with a low number of occurrences per variable
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Automated generation of simplification rules for SAT and MAXSAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
The worst-case upper bound for exact 3-satisfiability with the number of clauses as the parameter
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
In 1980 Monien and Speckenmeyer proved that satisfiability of a propositional formula consisting of iK clauses (of arbitrary length) can be checked in time of the order 2iK / 3. Recently Kullmann and Luckhardt proved the worst-case upper bound 2iL / 9, where iL is the length of the input formula. The algorithms leading to these bounds are based on the isplitting method, which goes back to the Davis–Putnam procedure. iTransformation rules (pure literal elimination, unit propagation, etc.) constitute a substantial part of this method. In this paper we present a new transformation rule and two algorithms using this rule. We prove that these algorithms have the worst-case upper bounds 20. 30897 iK and 20. 10299 iL, respectively.