Creignou, Nadia

1. A Complexity Theory for Hard Enumeration Problems
   2016/10/18 by Creignou, Nadia, Kröll, Markus, Pichler, Reinhard +2 · 3 citations
   #Computational Complexity (cs.CC) #F.1.3 #FOS: Computer and information sciences
2. Paradigms for Parameterized Enumeration
   2013/06/10 by Creignou, Nadia, Meier, Arne, Müller, Julian-Steffen +2 · 2 citations
   #03D15 #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
3. Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
   2009/12/16 by Creignou, Nadia, Schmidt, Johannes, Thomas, Michael · 2 citations
   #Artificial Intelligence (cs.AI) #Computational Complexity (cs.CC) #F.2.2 #FOS: Computer and information sciences #I.2.4 #Logic in Computer Science (cs.LO)
4. On the enumeration of signatures of XOR-CNF's
   2024/02/28 by Creignou, Nadia, Defrain, Oscar, Olive, Frédéric +1 · 1 citation
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics