Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Creignou, Nadia"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Belief revision within fragments of propositional logic
Nadia Creignou
,
Odile Papini
,
Reinhard Pichler
,
Stefan Woltran
Journal of Computer and System Sciences
80
(2), 2014, pp. 427-449
Paradigms for parameterized enumeration
Nadia Creignou
,
Arne Meier
,
Julian-Steffen Müller
,
Johannes Schmidt
,
Heribert Vollmer
Lecture Notes in Computer Science
8087
, 2013, pp. 290-301
The complexity of problems for quantified constraints
Michael Bauland
,
Elmar Böhler
,
Nadia Creignou
,
Steffen Reith
,
Henning Schnoor
,
Heribert Vollmer
Theory of Computing Systems
47
(2), 2010, pp. 454-490
Complexity of clausal constraints over chains
Nadia Creignou
,
Miki Hermann
,
Andrei Krokhin
,
Gernot Salzer
Theory of Computing Systems
42
(2), 2008, pp. 239-255
Structure identification of Boolean relations and plain bases for co-clones
Nadia Creignou
,
Phokion Kolaitis
,
Bruno Zanuttini
Journal of Computer and System Sciences
74
(7), 2008, pp. 1103-1115
A complete classification of the complexity of propositional abduction
Nadia Creignou
,
Bruno Zanuttini
SIAM Journal on Computing
36
(1), 2006, pp. 207-229
Combinatorial sharpness criterion and phase transition classification for Random CSPs
Nadia Creignou
,
Hervé Daudé
Information and Computation
190
(2), 2004, pp. 220-238
Coarse and sharp transitions for random generalized satisfyability problems
Nadia Creignou
,
Hervé Daudé
Trends in Mathematics
, 2004, pp. 507-516
Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory
Elmar Böhler
,
Nadia Creignou
,
Steffen Reith
,
Heribert Vollmer
ACM SIGACT News
34
(4), 2003, December, pp. 38-52
Generalized satisfiability problems: Minimal elements and phase transitions
Nadia Creignou
,
Hervé Daudé
Theoretical Computer Science
302
(1-3), 2003, pp. 417-430
Satisfiability threshold for random XOR-CNF formulas
Nadia Creignou
,
Hervé Daude
Discrete Applied Mathematics
96-97
, 1999, pp. 41-53
Complexity versus stability for classes of propositional formulas
Nadia Creignou
Information Processing Letters
68
(4), 1998, pp. 161-165
Complexity of generalized satisfiability counting problems
Nadia Creignou
,
Miki Hermann
Information and Computation
125
(1), 1996, pp. 1-12
A dichotomy theorem for maximum generalized satisfiability problems
Nadia Creignou
Journal of Computer and System Sciences
51
(3), 1995, pp. 511-522
The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness
Nadia Creignou
Theoretical Computer Science
145
(1-2), 1995, pp. 111-145