dblp.uni-trier.dewww.uni-trier.de

Nadia Creignou

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
33EENadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Springer 2008
32EENadia Creignou, Henning Schnoor, Ilka Schnoor: Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL 2008: 109-123
31EENadia Creignou, Heribert Vollmer: Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Complexity of Constraints 2008: 3-37
30EEVictor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer: Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ISMVL 2008: 100-105
29EENadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol: New Results on the Phase Transition for Random Quantified Boolean Formulas. SAT 2008: 34-47
28EENadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini: Structure identification of Boolean relations and plain bases for co-clones. J. Comput. Syst. Sci. 74(7): 1103-1115 (2008)
27EENadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer: Complexity of Clausal Constraints Over Chains. Theory Comput. Syst. 42(2): 239-255 (2008)
2007
26EEHeribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor: The Complexity of Problems for Quantified Constraints. Electronic Colloquium on Computational Complexity (ECCC) 14(023): (2007)
25EENadia Creignou, Hervé Daudé, Uwe Egly: Phase Transition for Random Quantified XOR-Formulas. J. Artif. Intell. Res. (JAIR) 29: 1-18 (2007)
2006
24 Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: Complexity of Constraints, 01.10. - 06.10.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
23EENadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006
22EENadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006
21EENadia Creignou, Bruno Zanuttini: A Complete Classification of the Complexity of Propositional Abduction. SIAM J. Comput. 36(1): 207-229 (2006)
2005
20EEPhilippe Chapdelaine, Nadia Creignou: The complexity of Boolean constraint satisfaction local search problems. Ann. Math. Artif. Intell. 43(1): 51-63 (2005)
19EENadia Creignou, Hervé Daudé, John V. Franco: A sharp threshold for the renameable-Horn and the q-Horn properties. Discrete Applied Mathematics 153(1-3): 48-57 (2005)
18EEMichael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer: Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation Electronic Colloquium on Computational Complexity (ECCC)(024): (2005)
17EENadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini: Preferred representations of Boolean relations Electronic Colloquium on Computational Complexity (ECCC)(119): (2005)
2004
16EEMichael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004
15EEMichael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (Selected Papers 2004: 30-45
14EENadia Creignou, Hervé Daudé: Combinatorial sharpness criterion and phase transition classification for random CSPs. Inf. Comput. 190(2): 220-238 (2004)
2003
13 Nadia Creignou, Hervé Daudé, Olivier Dubois: Approximating The Satisfiability Threshold For Random K-Xor-Formulas. Combinatorics, Probability & Computing 12(2): (2003)
12EENadia Creignou, Hervé Daudé: Smooth and sharp thresholds for random k-XOR-CNF satisfiability. ITA 37(2): 127-147 (2003)
11EENadia Creignou, Hervé Daudé: Generalized satisfiability problems: minimal elements and phase transitions. Theor. Comput. Sci. 302(1-3): 417-430 (2003)
2001
10EENadia Creignou, Hervé Daudé, Olivier Dubois: Approximating the satisfiability threshold for random k-XOR-formulas CoRR cs.DM/0106001: (2001)
1999
9EENadia Creignou, Hervé Daudé: Satisfiability Threshold for Random XOR-CNF Formulas. Discrete Applied Mathematics 96-97: 41-53 (1999)
1998
8EENadia Creignou: Complexity Versus Stability for Classes of Propositional Formulas. Inf. Process. Lett. 68(4): 161-165 (1998)
1997
7 Nadia Creignou, Jean-Jacques Hébrard: On Generating All Solutions of Generalized Satisfiability Problems. ITA 31(6): 499-511 (1997)
6 Nadia Creignou, Malika More: Complexity of Satisfiability Problems with Symmetric Polynomial Clauses. J. Log. Comput. 7(3): 353-366 (1997)
1996
5 Nadia Creignou: Exact Complexity of Problems of Incompletely Specified Automata. Ann. Math. Artif. Intell. 16: 237-249 (1996)
4 Nadia Creignou, Miki Hermann: Complexity of Generalized Satisfiability Counting Problems. Inf. Comput. 125(1): 1-12 (1996)
1995
3 Nadia Creignou: A Dichotomy Theorem for Maximum Generalized Satisfiability Problems. J. Comput. Syst. Sci. 51(3): 511-522 (1995)
2EENadia Creignou: The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. Theor. Comput. Sci. 145(1&2): 111-145 (1995)
1992
1 Nadia Creignou: The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. CSL 1992: 115-133

Coauthor Index

1Michael Bauland [15] [16] [18] [26]
2Elmar Böhler [18] [26]
3Philippe Chapdelaine [15] [16] [20]
4Victor Chepoi [30]
5Hervé Daudé [9] [10] [11] [12] [13] [14] [19] [25] [29]
6Olivier Dubois [10] [13]
7Uwe Egly [25] [29]
8John V. Franco [19]
9Jean-Jacques Hébrard [7]
10Miki Hermann [4] [15] [16] [27] [30]
11Phokion G. Kolaitis [17] [22] [23] [24] [28] [33]
12Andrei A. Krokhin [27]
13Malika More [6]
14Steffen Reith [18] [26]
15Raphaël Rossignol [29]
16Gernot Salzer [27] [30]
17Henning Schnoor [18] [26] [32]
18Ilka Schnoor [32]
19Heribert Vollmer [15] [16] [18] [22] [23] [24] [26] [31] [33]
20Bruno Zanuttini [17] [21] [28]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)