Counting Solutions to Random CNF Formulas

SIAM Journal on Computing ◽

10.1137/20m1351527 ◽

2021 ◽

Vol 50 (6) ◽

pp. 1701-1738

Author(s):

Andreas Galanis ◽

Leslie Ann Goldberg ◽

Heng Guo ◽

Kuan Yang

Keyword(s):

Counting Solutions ◽

Download Full-text

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances

ACM Transactions on Computational Logic ◽

10.1145/3091528 ◽

2017 ◽

Vol 18 (3) ◽

pp. 1-46

Author(s):

Ronald De Haan ◽

Iyad Kanj ◽

Stefan Szeider

Keyword(s):

Parameterized Complexity ◽

Download Full-text

Counting solutions of polynomial systems via iterated fibrations

Archiv der Mathematik ◽

10.1007/s00013-008-2785-7 ◽

2009 ◽

Vol 92 (1) ◽

pp. 44-56 ◽

Author(s):

Wilhelm Plesken

Keyword(s):

Polynomial Systems ◽

Counting Solutions

Download Full-text

Generalizations of matched CNF formulas

Annals of Mathematics and Artificial Intelligence ◽

10.1007/s10472-005-0432-6 ◽

2004 ◽

Vol 43 (1-4) ◽

pp. 223-238 ◽

Author(s):

Stefan Szeider

Keyword(s):

Download Full-text

ASIG: An all-solution SAT solver for CNF formulas

2009 11th IEEE International Conference on Computer-Aided Design and Computer Graphics ◽

10.1109/cadcg.2009.5246850 ◽

2009 ◽

Author(s):

Weinan Zhao ◽

Weimin Wu

Keyword(s):

Download Full-text

Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems

Principles and Practice of Constraint Programming – CP 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45193-8_6 ◽

2003 ◽

pp. 81-95 ◽

Author(s):

Ola Angelsmark ◽

Peter Jonsson

Keyword(s):

Constraint Satisfaction ◽

Constraint Satisfaction Problems ◽

Counting Solutions

Download Full-text

A Linear Time Algorithm for Computing #2SAT for Outerplanar 2-CNF Formulas

Lecture Notes in Computer Science - Pattern Recognition ◽

10.1007/978-3-319-92198-3_8 ◽

2018 ◽

pp. 72-81 ◽

Author(s):

Marco A. López ◽

J. Raymundo Marcial-Romero ◽

Guillermo De Ita ◽

Yolanda Moyao

Keyword(s):

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm ◽

Download Full-text

Parallel Variable Elimination on CNF Formulas

KI 2013: Advances in Artificial Intelligence - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40942-4_6 ◽

2013 ◽

pp. 61-73 ◽

Author(s):

Kilian Gebhardt ◽

Norbert Manthey

Keyword(s):

Variable Elimination ◽

Download Full-text

On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-18625-5_68 ◽

1987 ◽

pp. 456-469

Author(s):

V. Arvind ◽

S. Biswas

Keyword(s):

Satisfiability Problem ◽

Download Full-text

Recognition of Nested Gates in CNF Formulas

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing -- SAT 2015 ◽

10.1007/978-3-319-24318-4_19 ◽

2015 ◽

pp. 255-271 ◽

Author(s):

Markus Iser ◽

Norbert Manthey ◽

Carsten Sinz

Keyword(s):

Download Full-text

Counting solutions of the Bethe equations of the quantum group invariant open XXZ chain at roots of unity

Journal of Physics A Mathematical and Theoretical ◽

10.1088/1751-8113/48/49/494003 ◽

2015 ◽

Vol 48 (49) ◽

pp. 494003 ◽

Author(s):

Azat M Gainutdinov ◽

Wenrui Hao ◽

Rafael I Nepomechie ◽

Andrew J Sommese

Keyword(s):

Quantum Group ◽

Roots Of Unity ◽

Group Invariant ◽

Xxz Chain ◽

Bethe Equations ◽

Counting Solutions

Download Full-text