Nadia Creignou

Available identifiers

zbMath Open creignou.nadiaMaRDI QIDQ293436

List of research outcomes

Publication	Date of Publication	Type
Belief contraction and erasure in fragments of propositional logic	2022-11-01	Paper
Locally definable vertex set properties are efficiently enumerable	2021-09-15	Paper
A complexity theory for hard enumeration problems	2019-09-19	Paper
https://portal.mardi4nfdi.de/entity/Q4553280	2018-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q4576185	2018-07-12	Paper
Belief Update within Propositional Fragments	2018-05-02	Paper
Complexity of model checking for cardinality-based belief revision operators	2017-09-05	Paper
Paradigms for parameterized enumeration	2017-08-15	Paper
https://portal.mardi4nfdi.de/entity/Q5282977	2017-07-18	Paper
Belief Merging within Fragments of Propositional Logic	2017-07-12	Paper
A complexity theory for hard enumeration problems	2017-06-01	Paper
Complexity versus stability for classes of propositional formulas	2016-06-09	Paper
Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting	2016-05-11	Paper
Parameterized Enumeration for Modification Problems	2016-04-08	Paper
Belief Update Within Propositional Fragments	2015-11-10	Paper
Nonuniform Boolean constraint satisfaction problems with cardinality constraint	2015-09-17	Paper
Complexity Classifications for Logic-Based Argumentation	2015-09-17	Paper
Exact location of the phase transition for random (1,2)-QSAT	2015-04-15	Paper
Belief revision within fragments of propositional logic	2013-12-13	Paper
Paradigms for Parameterized Enumeration	2013-09-20	Paper
Parameterized Complexity of Weighted Satisfiability Problems	2013-08-12	Paper
Sensitivity of Boolean formulas	2013-03-19	Paper
Complexity classifications for different equivalence and audit problems for Boolean circuits	2012-10-22	Paper
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight	2011-06-17	Paper
The complexity of problems for quantified constraints	2010-10-06	Paper
https://portal.mardi4nfdi.de/entity/Q3576757	2010-08-02	Paper
The Helly property and satisfiability of Boolean formulas defined on set families	2010-04-27	Paper
The SAT-UNSAT transition for random constraint satisfaction problems	2009-06-19	Paper
https://portal.mardi4nfdi.de/entity/Q3624065	2009-04-28	Paper
Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?	2009-01-22	Paper
A dichotomy theorem for maximum generalized satisfiability problems.	2008-12-21	Paper
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint	2008-11-20	Paper
Structure identification of Boolean relations and plain bases for co-clones	2008-11-19	Paper
New Results on the Phase Transition for Random Quantified Boolean Formulas	2008-05-27	Paper
Complexity of clausal constraints over chains	2008-04-03	Paper
A Complete Classification of the Complexity of Propositional Abduction	2006-06-01	Paper
A sharp threshold for the renameable-Horn and the \(q\)-Horn properties	2006-01-10	Paper
Theory and Applications of Satisfiability Testing	2005-12-16	Paper
The complexity of Boolean constraint satisfaction local search problems	2005-05-13	Paper
https://portal.mardi4nfdi.de/entity/Q3154710	2005-01-14	Paper
Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability	2004-10-28	Paper
Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability	2004-10-28	Paper
Combinatorial sharpness criterion and phase transition classification for random CSPs	2004-08-06	Paper
Generalized satisfiability problems: Minimal elements and phase transitions.	2003-08-17	Paper
Approximating the Satisfiability Threshold for Random k-XOR-formulas	2003-01-01	Paper
Complexity Classifications of Boolean Constraint Satisfaction Problems	2001-07-03	Paper
Satisfiability threshold for random XOR-CNF formulas	2000-01-17	Paper
On generating all solutions of generalized satisfiability problems	1998-05-24	Paper
Complexity of satisfiability problems with symmetric polynomial clauses	1998-01-12	Paper
The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness	1997-02-28	Paper
Complexity of generalized satisfiability counting problems	1997-01-02	Paper
Exact complexity of problems of incompletely specified automata	1996-12-01	Paper
https://portal.mardi4nfdi.de/entity/Q4283234	1994-08-21	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Nadia Creignou