( en | de | ru )

 

Disambiguation of "Creignou, Nadia"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Hard Enumeration Problems

, , , , and . Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Ume\aa, Sweden, March 6-9, 2017, Proceedings, volume 10168 of Lecture Notes in Computer Science, page 183--195. (2017)
DOI: 10.1007/978-3-319-53733-7_13

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nadia Klein

Nadia Kapernaum

Nadia Müller

Nadia Sallam

Nadia Harbeck

 

Other publications of authors with the same name

06401 Abstracts Collection - Complexity of Constraints., , and . Complexity of Constraints, volume 06401 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness.. CSL, volume 702 of Lecture Notes in Computer Science, page 115-133. Springer, (1992)Satisfiability Threshold for Random XOR-CNF Formulas., and . Discret. Appl. Math., (1999)Paradigms for Parameterized Enumeration, , , , and . Theory Comput. Syst., 60 (4): 737--758 (2017)The Helly property and satisfiability of Boolean formulas defined on set families., , , and . Eur. J. Comb., 31 (2): 502-516 (2010)On the Complexity of Hard Enumeration Problems, , , , and . (2016)cite arxiv:1610.05493.Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?., and . Complexity of Constraints, volume 5250 of Lecture Notes in Computer Science, page 3-37. Springer, (2008)Belief Update in the Horn Fragment., , , and . IJCAI, page 1781-1787. ijcai.org, (2018)Enumeration Classes Defined by Circuits., , and . MFCS, volume 241 of LIPIcs, page 38:1-38:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?, , and . IJCAI, page 824-831. IJCAI/AAAI, (2013)