The following pages link to Nadia Creignou (Q293436):
Displaying 50 items.
- Complexity versus stability for classes of propositional formulas (Q293437) (← links)
- Belief revision within fragments of propositional logic (Q386044) (← links)
- Combinatorial sharpness criterion and phase transition classification for random CSPs (Q598196) (← links)
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091) (← links)
- Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
- A dichotomy theorem for maximum generalized satisfiability problems. (Q960525) (← links)
- The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
- The SAT-UNSAT transition for random constraint satisfaction problems (Q1025462) (← links)
- Generalized satisfiability problems: Minimal elements and phase transitions. (Q1401338) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- Exact complexity of problems of incompletely specified automata (Q1817068) (← links)
- Complexity of generalized satisfiability counting problems (Q1917076) (← links)
- Sensitivity of Boolean formulas (Q1943387) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- Satisfiability threshold for random XOR-CNF formulas (Q1961446) (← links)
- Locally definable vertex set properties are efficiently enumerable (Q1983133) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- Paradigms for parameterized enumeration (Q2398214) (← links)
- Complexity of model checking for cardinality-based belief revision operators (Q2401889) (← links)
- Complexity of clausal constraints over chains (Q2480746) (← links)
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (Q2581546) (← links)
- Complexity Classifications of Boolean Constraint Satisfaction Problems (Q2723175) (← links)
- Parameterized Enumeration for Modification Problems (Q2799203) (← links)
- Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting (Q2805407) (← links)
- Parameterized Complexity of Weighted Satisfiability Problems (Q2843338) (← links)
- Paradigms for Parameterized Enumeration (Q2849918) (← links)
- Nonuniform Boolean constraint satisfaction problems with cardinality constraint (Q2946612) (← links)
- Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
- Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (Q3007678) (← links)
- (Q3154710) (← links)
- Complexity classifications for different equivalence and audit problems for Boolean circuits (Q3166221) (← links)
- Belief Update Within Propositional Fragments (Q3451174) (← links)
- New Results on the Phase Transition for Random Quantified Boolean Formulas (Q3502691) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- (Q3576757) (← links)
- (Q3624065) (← links)
- (Q4283234) (← links)
- Complexity of satisfiability problems with symmetric polynomial clauses (Q4344698) (← links)
- On generating all solutions of generalized satisfiability problems (Q4389761) (← links)
- (Q4553280) (← links)
- (Q4576185) (← links)
- Belief Update within Propositional Fragments (Q4639038) (← links)
- Approximating the Satisfiability Threshold for Random k-XOR-formulas (Q4802163) (← links)
- Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability (Q4825479) (← links)
- Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability (Q4825480) (← links)
- Belief contraction and erasure in fragments of propositional logic (Q5044549) (← links)
- Exact location of the phase transition for random (1,2)-QSAT (Q5245725) (← links)
- Belief Merging within Fragments of Propositional Logic (Q5277921) (← links)
- (Q5282977) (← links)
- A Complete Classification of the Complexity of Propositional Abduction (Q5470752) (← links)
