Faster algorithm for unique (k,2)-CSP

DOI10.4230/LIPICS.ESA.2022.92MaRDI QIDQ6969580zbMATH OpenFDO

Authors Or Zamir

Publication date 19 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2022.92

zbMATH Keywords

algorithmsconstraint satisfaction problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• 3-coloring in time
• 3-SAT faster and simpler -- unique-SAT bounds for PPSZ hold in general
• A note on the complexity of the chromatic number problem
• An improved exponential-time algorithm for k -SAT
• An improved exponential-time algorithm for k-SAT
• Exact exponential algorithms.
• Faster k-SAT algorithms using biased-PPSZ
• scientific article; zbMATH DE number 1953201 (Why is no real title available?)
• scientific article; zbMATH DE number 7788606 (Why is no real title available?)
• Set partitioning via inclusion-exclusion
• Solving satisfiability in less than \(2^ n\) steps
• The complexity of satisfiability of small depth circuits
• The Time Complexity of Constraint Satisfaction
• Worst-case time bounds for coloring and satisfiability problems

This page was built for publication: Faster algorithm for unique \((k,2)\)-CSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969580)