Article

The time complexity of constraint satisfaction

Author:

Patrick TraxlerAuthors Info & Claims

IWPEC'08: Proceedings of the 3rd international conference on Parameterized and exact computation

Pages 190 - 201

Published: 14 May 2008 Publication History

Abstract

We study the time complexity of (d, k)-CSP, the problem ofdeciding satisfiability of a constraint system C with n variables, domainsize d, and at most k variables per constraint. We are interested in thequestion how the domain size d influences the complexity of decidingsatisfiability. We show, assuming the Exponential Time Hypothesis, thattwo special cases, namely (d, 2)-CSP with bounded variable frequencyand d-UNIQUE-CSP, already require exponential time Ω(d^cċn) for somec > 0 independent of d. UNIQUE-CSP is the special case for which it isguaranteed that every input constraint system has at most 1 satisfyingassignment.

References

[1]

Björklund, A., Husfeldt, T.: Inclusion-exclusion algorithms for counting set partitions.In: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 575-582 (2006).

Digital Library

[2]

Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.: The complexity of uniquek-SAT: An isolation lemma for k-CNFs. In: Proc. of the 18th Annual IEEE Conferenceon Computational Complexity, pp. 135-141 (2003).

[3]

Eppstein, D.: Improved algorithms for 3-coloring, 3-edge-coloring, and constraintsatisfaction. In: Proc. of the 12th Annual ACM-SIAM Symposium on DiscreteAlgorithms, pp. 329-337 (2001).

Digital Library

[4]

Feder, T., Motwani, R.:Worst-case time bounds for coloring and satisfiability problems.J. Algorithms 45(2), 192-201 (2002).

Digital Library

[5]

Haxell, P.E.: A condition for matchability in hypergraphs. Graphs and Combinatorics11, 245-248 (1995).

[6]

Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Computer and SystemSciences 62(2), 367-375 (2001).

Digital Library

[7]

Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponentialcomplexity? J. Computer and System Sciences 63(4), 512-530 (2001).

Digital Library

[8]

Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proc. of the 15thAnnual ACM-SIAM Symposium on Discrete Algorithms, pp. 328-329 (2004).

Digital Library

[9]

Johnson, D.S., Szegedy, M.: What are the least tractable instances of max independentset? In: Proc. of the 10th Annual ACM-SIAM Symposium on DiscreteAlgorithms, pp. 927-928 (1999).

Digital Library

[10]

Koivisto, M.: An O(2ⁿ) algorithm for graph coloring and other partitioning problemsvia inclusion-exclusion. In: Proc. of the 47th Annual IEEE Symposium onFoundations of Computer Science, pp. 583-590 (2006).

Digital Library

[11]

Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion.Combinatorica 7(1), 105-113 (1987).

Digital Library

[12]

Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems.In: Proc. of the 40th Annual Symposium on Foundations of Computer Science,pp. 410-414 (1999).

Digital Library

[13]

Scott, A.D., Sorkin, G.B.: An LP-Designed Algorithm for Constraint Satisfaction.In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 588-599. Springer,Heidelberg (2006).

Digital Library

[14]

Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. TheoreticalComputer Science 47(1), 85-93 (1986).

Digital Library

[15]

Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications.Theoretical Computer Science 348(2-3), 357-365 (2005).

Digital Library

Cited By

Björklund AKaski PMarx D(2021)The fine-grained complexity of computing the tutte polynomial of a linear matroidProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458203(2333-2345)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458203
Vyas NWilliams R(2021)On Super Strong ETHJournal of Artificial Intelligence Research10.1613/jair.1.1185970(473-495)Online publication date: 1-May-2021
https://dl.acm.org/doi/10.1613/jair.1.11859
van Melkebeek DPrakriya G(2017)Derandomizing isolation in space-bounded settingsProceedings of the 32nd Computational Complexity Conference10.5555/3135595.3135600(1-32)Online publication date: 9-Jul-2017
https://dl.acm.org/doi/10.5555/3135595.3135600
Show More Cited By

The time complexity of constraint satisfaction
1. Theory of computation

Recommendations

The computational complexity of quantified constraint satisfaction
The resolution complexity of constraint satisfaction
Relatively quantified constraint satisfaction

The constraint satisfaction problem (CSP) is a convenient framework for modelling search problems; the CSP involves deciding, given a set of constraints on variables, whether or not there is an assignment to the variables satisfying all of the ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

IWPEC'08: Proceedings of the 3rd international conference on Parameterized and exact computation

May 2008

226 pages

ISBN:354079722X

Editors:
Martin Grohe
Humbold Universität zu Berlin, Institut für Information, Berlin, Germany
,
Rolf Niedermeier
Friedrich-Schiller-Universität Jena, Institut für Informatik, Jena, Germany

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 14 May 2008

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Björklund AKaski PMarx D(2021)The fine-grained complexity of computing the tutte polynomial of a linear matroidProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458203(2333-2345)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458203
Vyas NWilliams R(2021)On Super Strong ETHJournal of Artificial Intelligence Research10.1613/jair.1.1185970(473-495)Online publication date: 1-May-2021
https://dl.acm.org/doi/10.1613/jair.1.11859
van Melkebeek DPrakriya G(2017)Derandomizing isolation in space-bounded settingsProceedings of the 32nd Computational Complexity Conference10.5555/3135595.3135600(1-32)Online publication date: 9-Jul-2017
https://dl.acm.org/doi/10.5555/3135595.3135600
Cygan MFomin FGolovnev AKulikov AMihajlin IPachocki JSocała A(2017)Tight Lower Bounds on Graph Embedding ProblemsJournal of the ACM10.1145/305109464:3(1-22)Online publication date: 16-Jun-2017
https://dl.acm.org/doi/10.1145/3051094
Cygan MFomin FGolovnev AKulikov AMihajlin IPachocki JSocała A(2016)Tight bounds for graph homomorphism and subgraph isomorphismProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884547(1643-1649)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884547
Aghighi MBäckström CJonsson PStåhlberg S(2016)Analysing approximability and heuristics in planning using the exponential-time hypothesisProceedings of the Twenty-second European Conference on Artificial Intelligence10.3233/978-1-61499-672-9-184(184-192)Online publication date: 29-Aug-2016
https://dl.acm.org/doi/10.3233/978-1-61499-672-9-184
Cygan MDell HLokshtanov DMarx DNederlof JOkamoto YPaturi RSaurabh SWahlström M(2016)On Problems as Hard as CNF-SATACM Transactions on Algorithms10.1145/292541612:3(1-24)Online publication date: 24-May-2016
https://dl.acm.org/doi/10.1145/2925416
Socała A(2016)Tight Lower Bound for the Channel Assignment ProblemACM Transactions on Algorithms10.1145/287650512:4(1-19)Online publication date: 2-Sep-2016
https://dl.acm.org/doi/10.1145/2876505
Aghighi MBäckström CJonsson PStåhlberg S(2016)Refining complexity analyses in planning by exploiting the exponential time hypothesisAnnals of Mathematics and Artificial Intelligence10.1007/s10472-016-9521-y78:2(157-175)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1007/s10472-016-9521-y
Kowalik LSocała A(2016)Assigning Channels Via the Meet-in-the-Middle ApproachAlgorithmica10.1007/s00453-015-0004-z74:4(1435-1452)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s00453-015-0004-z
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents