An algorithm for Exact Satisfiability analysed with the number of clauses as parameter

Information Processing Letters

Volumn 97, Issue 1, 2006, Pages 28-30

  Madsen, Bolette Ammitzbøll ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Analysis of algorithms; Exact satisfiability

Indexed keywords

MATHEMATICAL MODELS; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING;

ANALYSIS OF ALGORITHMS; EXACT SATISFIABILITY; POLYNOMIAL SPACE;

ALGORITHMS;

EID: 27844572473     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.08.011     Document Type: Article

References (11)

1. J.M. Byskov Enumerating maximal independent sets with applications to graph colouring Oper. Res. Lett. 32 2004 547 556
2. J.M. Byskov, B.A. Madsen, and B. Skjernaa New algorithms for exact satisfiability Theoret. Comput. Sci. 332 2004 515 541
3. E. Dantsin, E.A. Hirsch, and A. Wolpert Algorithms for SAT based on search in hamming balls Proc. 21st Annual Symp. on Theoretical Aspects of Computer Science, STAGS 2004 Lecture Notes in Comput. Sci. vol. 2996 March 2004 Springer Berlin 141 151
4. E. Dantsin, A. Wolpert, Derandomization of Schuler's algorithm for SAT, in: Proc. 7th Internat. Conf. on Theory and Applications of Satisfiability Testing, SAT 2004, May 2004, pp. 69-75
5. E.A. Hirsch New worst-case upper bounds for SAT J. Automat. Reason. 24 4 2000 397 420
6. M.V. Krieken, H. Fleuren, M. Peeters, A Lagrangean relaxation based algorithm for solving set partitioning problems, Technical Report 44, Tilburg University, Center for Economic Research, April 2004
7. B. Monien, E. Speckenmeyer, and O. Vornberger Upper bounds for covering problems Methods Oper. Res. 43 1981 419 431
8. S. Porschen On some weighted satisfiability and graph problems P. Vojtás M. Bieliková B. Charron-Bost O. Sýkora SOFSEM Lecture Notes in Comput. Sci. vol. 3381 2005 Springer Berlin 278 287
9. J.W. Rosenthal, E. Speckenmeyer, and R. Kemp Exact satisfiability, a natural extension of set partition and its average case behavior Ann. of Math. Artificial Intelligence 6 1-3 1992 185 200
10. T.J. Schaefer, The complexity of satisfiability problems, in: Proc. 10th Annual ACM Symp. on Theory of Computing, 1978, pp. 216-226
11. B. Skjernaa, Exact algorithms for variants of satisfiability and colouring problems, PhD thesis, BRICS, Department of Computer Science, Aarhus University, September 2004