( en | de | ru )

 

Disambiguation of "Creignou, Nadia"

Author of the publication

copydeleteadd this publication to your clipboard
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?

, , and . CoRR, (2017)

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 Harbeck

Nadia Rinaldi

 

Other publications of authors with the same name

On the Complexity of Hard Enumeration Problems., , , , and . LATA, volume 10168 of Lecture Notes in Computer Science, page 183-195. (2017)Parameterized Enumeration for Modification Problems., , , , , and . LATA, volume 8977 of Lecture Notes in Computer Science, page 524-536. Springer, (2015)Smooth and sharp thresholds for random k-XOR-CNF satisfiability., and . RAIRO Theor. Informatics Appl., 37 (2): 127-147 (2003)Complexity of Reasoning with Cardinality Minimality Conditions., , and . AAAI, page 3932-3940. AAAI Press, (2023)Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?, , and . IJCAI, page 824-831. IJCAI/AAAI, (2013)Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics., , , and . ISMVL, page 100-105. IEEE Computer Society, (2008)Paradigms for Parameterized Enumeration, , , , and . Theory Comput. Syst., 60 (4): 737--758 (2017)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)Belief contraction and erasure in fragments of propositional logic., , and . J. Log. Comput., 32 (7): 1436-1468 (2022)The SAT-UNSAT transition for random constraint satisfaction problems., and . Discret. Math., 309 (8): 2085-2099 (2009)