The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nadia Creignou: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nadia Creignou
    The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. [Citation Graph (0, 0)][DBLP]
    CSL, 1992, pp:115-133 [Conf]
  2. Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
    An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  3. Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
    An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:30-45 [Conf]
  4. Philippe Chapdelaine, Nadia Creignou
    The complexity of Boolean constraint satisfaction local search problems. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:51-63 [Journal]
  5. Nadia Creignou
    Exact Complexity of Problems of Incompletely Specified Automata. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:16, n:, pp:237-249 [Journal]
  6. Nadia Creignou, Hervé Daudé, Olivier Dubois
    Approximating the satisfiability threshold for random k-XOR-formulas [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  7. Nadia Creignou, Hervé Daudé, Olivier Dubois
    Approximating The Satisfiability Threshold For Random K-Xor-Formulas. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:2, pp:- [Journal]
  8. Nadia Creignou, Hervé Daudé
    Satisfiability Threshold for Random XOR-CNF Formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:41-53 [Journal]
  9. Nadia Creignou, Hervé Daudé, John V. Franco
    A sharp threshold for the renameable-Horn and the q-Horn properties. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:48-57 [Journal]
  10. Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
    Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:024, pp:- [Journal]
  11. Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini
    Preferred representations of Boolean relations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:119, pp:- [Journal]
  12. Nadia Creignou, Hervé Daudé
    Combinatorial sharpness criterion and phase transition classification for random CSPs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:190, n:2, pp:220-238 [Journal]
  13. Nadia Creignou, Miki Hermann
    Complexity of Generalized Satisfiability Counting Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:125, n:1, pp:1-12 [Journal]
  14. Nadia Creignou
    Complexity Versus Stability for Classes of Propositional Formulas. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:4, pp:161-165 [Journal]
  15. Nadia Creignou, Hervé Daudé
    Smooth and sharp thresholds for random k-XOR-CNF satisfiability. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:2, pp:127-147 [Journal]
  16. Nadia Creignou, Jean-Jacques Hébrard
    On Generating All Solutions of Generalized Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    ITA, 1997, v:31, n:6, pp:499-511 [Journal]
  17. Nadia Creignou
    A Dichotomy Theorem for Maximum Generalized Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:511-522 [Journal]
  18. Nadia Creignou, Malika More
    Complexity of Satisfiability Problems with Symmetric Polynomial Clauses. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1997, v:7, n:3, pp:353-366 [Journal]
  19. Nadia Creignou
    The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:145, n:1&2, pp:111-145 [Journal]
  20. Nadia Creignou, Hervé Daudé
    Generalized satisfiability problems: minimal elements and phase transitions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:417-430 [Journal]
  21. Nadia Creignou, Hervé Daudé, Uwe Egly
    Phase Transition for Random Quantified XOR-Formulas. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2007, v:29, n:, pp:1-18 [Journal]
  22. Nadia Creignou, Bruno Zanuttini
    A Complete Classification of the Complexity of Propositional Abduction. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:207-229 [Journal]

  23. Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. [Citation Graph (, )][DBLP]


  24. 06401 Abstracts Collection - Complexity of Constraints. [Citation Graph (, )][DBLP]


  25. 06401 Executive Summary - Complexity of Constraints. [Citation Graph (, )][DBLP]


  26. Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. [Citation Graph (, )][DBLP]


  27. Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. [Citation Graph (, )][DBLP]


  28. Sets of Boolean Connectives That Make Argumentation Easier. [Citation Graph (, )][DBLP]


  29. Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. [Citation Graph (, )][DBLP]


  30. New Results on the Phase Transition for Random Quantified Boolean Formulas. [Citation Graph (, )][DBLP]


  31. (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. [Citation Graph (, )][DBLP]


  32. The threshold for random (1,2)-QSAT [Citation Graph (, )][DBLP]


  33. Complexity of Propositional Abduction for Restricted Sets of Boolean Functions [Citation Graph (, )][DBLP]


  34. The Complexity of Reasoning for Fragments of Autoepistemic Logic [Citation Graph (, )][DBLP]


  35. Complexity Classifications for Propositional Abduction in Post's Framework [Citation Graph (, )][DBLP]


  36. The SAT-UNSAT transition for random constraint satisfaction problems. [Citation Graph (, )][DBLP]


  37. The Complexity of Problems for Quantified Constraints. [Citation Graph (, )][DBLP]


  38. The Helly property and satisfiability of Boolean formulas defined on set families. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002