Complexity classifications of Boolean constraint satisfaction problems
- N. Creignou, S. Khanna, M. Sudan
- Computer ScienceSIAM monographs on discrete mathematics and…
- 2001
Theorems for Optimization Problems and the Complexity of the Meta-Problems are discussed, as well as some examples of how classification theorems can be applied to optimization problems.
Complexity of Generalized Satisfiability Counting Problems
- N. Creignou, M. Hermann
- Mathematics, Computer ScienceInformation and Computation
- 25 February 1996
A Dichotomy Theorem is proved that if all logical relations involved in a generalized satisfiability counting problem are affine then the number of satisfying assignments of this problem can be computed in polynomial time, otherwise this function is #P-complete.
A Dichotomy Theorem for Maximum Generalized Satisfiability Problems
- N. Creignou
- MathematicsJournal of computer and system sciences (Print)
- 1 December 1995
The existence of a dichotomic classification for optimization satisfiability problems Max-Sat(S) is proved, which is a particular infinite set of logical relations L, such that the following holds: If every relation in S is 0-valid (respectively 1-valid) or if even/relation in S belongs to L, then Max-S is solvable in polynomial time, otherwise it is MAX SNP-complete.
On Generating All Solutions of Generalized Satisfiability Problems
- N. Creignou, Jean-Jacques Hébrard
- Computer ScienceRAIRO - Theoretical Informatics and Applications
- 1997
There exists a class G of problems such that for every problem in there exists a polynomial delay generating algorithm and for every Generalized Satisfiability problem not in G such an algorithm does not exist unless P = NP.
Structure identification of Boolean relations and plain bases for co-clones
- N. Creignou, Phokion G. Kolaitis, B. Zanuttini
- Computer Science, MathematicsJournal of computer and system sciences (Print)
- 1 November 2008
The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness
- N. Creignou
- MathematicsTheoretical Computer Science
- 10 July 1995
Satisfiability Threshold for Random XOR-CNF Formulas
- N. Creignou, H. Daudé
- MathematicsDiscrete Applied Mathematics
- 15 October 1999
Paradigms for Parameterized Enumeration
- N. Creignou, A. Meier, Julian-Steffen Müller, Johannes Schmidt, H. Vollmer
- Computer ScienceTheory of Computing Systems
- 10 June 2013
Three formally different notions of efficient enumeration in the context of parameterized complexity are defined: FPT-enumeration and delayFPT, and how different algorithmic paradigms can be used in order to get parameter-efficient enumeration algorithms is shown.
Generalized satisfiability problems: minimal elements and phase transitions
- N. Creignou, H. Daudé
- Computer Science, MathematicsTheoretical Computer Science
- 13 June 2003
...
...