Travelled to:1 × China
1 × Czech Republic
1 × France
1 × United Kingdom
2 × USA
3 × Canada
4 × Italy
Collaborated with:H.Vollmer H.Daudé U.Egly J.Schmidt F.Olive R.Rossignol ∅ M.Bauland P.Chapdelaine M.Hermann M.Seidl M.Thomas H.Schnoor I.Schnoor O.Papini R.Pichler S.Woltran R.Ktari A.Meier J.Müller
Talks about:problem (5) complex (4) boolean (4) satisfi (3) general (3) random (3) constraint (2) parameter (2) proposit (2) conjunct (2)
Person: Nadia Creignou
DBLP: Creignou:Nadia
Contributed to:
2015
2012
2012
2012201120102009
200820082004200520021992Wrote 13 papers:
- LATA-2015-CreignouKMMOV #problem
- Parameterized Enumeration for Modification Problems (NC, RK, AM, JSM, FO, HV), pp. 524–536.
- KR-2012-CreignouPPW #logic
- Belief Revision within Fragments of Propositional Logic (NC, OP, RP, SW).
- SAT-2012-CreignouV #complexity #problem #satisfiability
- Parameterized Complexity of Weighted Satisfiability Problems (NC, HV), pp. 341–354.
- TAP-2012-CreignouES #framework #random #satisfiability #specification
- A Framework for the Specification of Random SAT and QSAT Formulas (NC, UE, MS), pp. 163–168.
- SAT-2011-CreignouOS #csp
- Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (NC, FO, JS), pp. 120–133.
- KR-2010-CreignouST #abduction #complexity #set #strict
- Complexity of Propositional Abduction for Restricted Sets of Boolean Functions (NC, JS, MT).
- SAT-2009-CreignouDER #comprehension
- (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms (NC, HD, UE, RR), pp. 363–376.
- CSL-2008-CreignouSS #constraints #problem
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (NC, HS, IS), pp. 109–123.
- SAT-2008-CreignouDER #quantifier #random
- New Results on the Phase Transition for Random Quantified Boolean Formulas (NC, HD, UE, RR), pp. 34–47.
- SAT-2004-BaulandCCHV #algebra #approach #complexity #query
- An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 181–190.
- SAT-J-2004-BaulandCCHV05 #algebra #approach #complexity #query
- An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 30–45.
- SAT-2002-CreignouD #problem #random #satisfiability
- Random generalized satisfiability problems (NC, HD), p. 2.
- CSL-1992-Creignou #linear #problem #proving #satisfiability
- The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness (NC), pp. 115–133.