Abstract
The problem of determining whether a Boolean formula in conjunctive normal form is satisfiable in such a way that in each clause exactly one literal is set true, and all the other literals are set false is called the exact satisfiability problem. The exact satisfiability problem is well known to be NP-complete [5] and it contains the well known set partitioning problem as a special case. We study here the average time complexity of a simple backtracking strategy for solving the exact satisfiability problem under two probability models, the constant density model and the constant degree model. For both models we present results sharply separating classes of instances solvable in low degree polynomial time in the average from classes for which superpolynomial or exponential time is needed in the average.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas and M. Padberg, Set partitioning — a survey, in:Combinatorial Optimization, eds. Christophides et al. (Wiley, Chichester, 1979).
E.A. Bender, Asymptotic methods in enumeration, SIAM Rev. 16 (1974) 485–515.
C.A. Brown and P.W. Purdom, An average time analysis of backtracking, SIAM J. Comput. 10 (1981) 583–593.
M.T. Chao and J. Franco, Probabilistic analysis of two heuristics for 3-satisfiability, SIAM J. Comput. 15 (1986) 1106–1118.
J. Franco, On the probabilistic performance of algorithms for the satisfiability problem, Inform. Proc. Lett. 23 (1986) 103–106.
M.R. Garey and D.S. Johnson,Computers and Intractability — A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
A. Goldberg, P. Purdom and C. Brown, Average time analysis of simplified Davis-Putnam procedures, Inform. Proc. Lett. 15 (1982) 72–75.
R. Kemp, private communication.
R. Kemp and E. Speckenmeyer, On the average time complexity of set partition,Proc. CSL '89, Lecture Notes Comput. Sci. 440 (Springer, Berlin, 1990) pp. 369–389.
B. Monien, E. Speckenmeyer and O. Vornberger, Upper bounds for covering problems, Meth. Oper. Res. 43 (1982) 419–431.
P.W. Purdom and C.A. Brown, An analysis of backtracking with search rearrangement, SIAM J. Comput. 12 (1983) 717–733.
P.W. Purdom and C.A. Brown, The pure literal rule and polynomial average time, SIAM J. Comput. 14 (1985) 943–953.
E. Speckenmeyer, On the average case complexity of backtracking for the exact-satisfiability problem,Proc. CSL'87, Lecture Notes Comput. Sci. 329 (Springer, Berlin, 1988) pp. 281–288.
E. Speckenmeyer, On the average case behavior of backtracking for satisfiability and exact-satisfiability, Tech. Rep. 50, Dept. Math.-Comput. Sci., Universität-GH Paderhorn (Habilitationsschrift) (1988).
E. Speckenmeyer, Classes of CNF-formulas with backtracking trees of exponential or linear average order for exact-satisfiability,Proc. MFCS'88, Lecture Notes Comput. Sci. 324 (Springer, Berlin, 1988) pp. 529–537.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rosenthal, J.W., Speckenmeyer, E. & Kemp, R. Exact satisfiability, a natural extension of set partition, and its average case behavior. Ann Math Artif Intell 6, 185–200 (1992). https://doi.org/10.1007/BF01531028
Issue Date:
DOI: https://doi.org/10.1007/BF01531028