vix.ing · top · new · best · stats · spec

Heribert Vollmer

  1. A complexity theory for hard enumeration problems
    2019/03/06 by Nadia Creignou, Markus Kröll, Reinhard Pichler +2 · 5 citations
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Constraint Satisfaction and Optimization
  2. A Complexity Theory for Hard Enumeration Problems
    2016/10/18 by Nadia Creignou, Creignou, Nadia, Markus Kröll +7 · 3 citations
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #F.1.3 #FOS: Computer and information sciences #Machine Learning and Algorithms
  3. Paradigms for Parameterized Enumeration
    2013/06/10 by Nadia Creignou, Arne Meier, Creignou, Nadia +7 · 2 citations
    Computer Science · #03D15 #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.CC #cs.LO #msc:03D15
  4. The descriptive complexity approach to LOGCFL
    1998/09/28 by Clemens Lautemann, Lautemann, Clemens, Pierre McKenzie +5 · 1 citation
    Computer Science · #Computational Complexity (cs.CC) #F.1.3 #FOS: Computer and information sciences #cs.CC
  5. The Tractability of Model-Checking for LTL: The Good, the Bad, and the\n Ugly Fragments
    2008/05/05 by Michael Bauland, Martin Mundhenk, Bauland, Michael +9 · 1 citation
    Computer Science · #Computational Complexity (cs.CC) #F.4.1 #FOS: Computer and information sciences #Formal Methods in Verification #I.2.4 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
  6. Complexity of Non-Monotonic Logics
    2010/09/10 by Michael Thomas, Heribert Vollmer, Thomas, Michael +1 · 1 citation
    Computer Science · #Artificial Intelligence (cs.AI) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.AI #cs.CC #cs.LO
  7. Complexity Results for Modal Dependence Logic
    2011/04/04 by Peter Lohmann, Lohmann, Peter, Heribert Vollmer +1 · 1 citation
    Computer Science · #Computational Complexity (cs.CC) #F.2.2 #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.CC #cs.LO
  8. Equivalence and Isomorphism for Boolean Constraint Satisfaction
    2002/02/25 by E. Boehler, E. Hemaspaandra, Boehler, E. +6 · 1 citation
    Computer Science · Engineering · #Advanced Graph Theory Research #Constraint Satisfaction and Optimization #Scheduling and Optimization Algorithms #cs.CC #cs.LO
  9. A Van Benthem Theorem for Modal Team Semantics
    2014/10/24 by Juha Kontinen, Julian-Steffen Müller, Kontinen, Juha +5 · 1 citation
    Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.LO