On the parameterized complexity of exact satisfiability problems

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 568-579

  Kneis, Joachim ^a   Mölle, Daniel ^a   Richter, Stefan ^a   Rossmanith, Peter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; PARAMETER ESTIMATION; PROBLEM SOLVING;

PARAMETER TRACTABILITY; PARAMETERIZED COMPLEXITY; SATISFIABILITY PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 26844557385     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_49     Document Type: Conference Paper

References (15)

1. J. M. Byskov, B. A. Madsen, and B. Skjernaa. New algorithms for exact satisfiability. Technical Report RS-03-30, BRICS, Oct. 2003.
2. V. Dahllöf, P. Johnson, and R. Beigel. Algorithms for four variants of the exact satisfiability problem. Theoretical Comp. Sci., 320(2-3):373-394, 2004.
3. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
4. M. Garey, D. Johnson, and L. Stockmeyer. Some simplified np-complete graph problems. Theoretical Computer Science, 1:237-267, 1976.
5. J. Gramm, E. A. Hirsch, R. Niedermeier, and P. Rossmanith. New worst-case upper bounds for MAX-2-SAT with application to MAX-CUT. Discrete Applied Mathematics, 130(2):139-155, 2003.
6. W. Jia, C. Zhang, and J. Chen. An efficient parameterized algorithm for m-set packing. Journal of Algorithms, 50(1):106-117, 2004.
7. R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Communications, pages 85-103. Plenum Press, 1972.
8. 0.16254n): A simpler proof. Zapiski nauchnyh seminarov POMI, 293:118-128, 2002.
9. B. Madsen. An algorithm for exact satisfiability analysed with the number of clauses as parameter. Technical Report RS-04-18, BRIGS, 2004.
10. B. A. Madsen and P. Rossmanith. Maximum exact satisfiability: NP-completeness proofs and exact algorithms. Technical Report RS-04-19, BRIGS, Oct. 2004.
11. M. Mahajan and V. Raman. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms, 31:335-354, 1999.
12. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
13. 0.16254n). in proc_ 5th Int. Symp. on the Theory and Appl. Satisfiabilty testing (SAT2002), pages 231-235, 2002.
14. G. P. Schnorr. Satisfiability is quasilinear complete in NQL. J. ACM, 25:136-145, 1978.
15. R. Williams. A new algorithm for optimal constraint satisfaction and its implications. In Proc. of 31st ICALP, number 3142 in LNCS, pages 1227-1237. Springer, 2004.