Search results for: Heribert Vollmer
Lecture Notes in Computer Science > STACS 2004 > Satisfiability – Constraint Satisfaction Problem > 164-175
Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 2011 > Contributed Papers > 84-95
Lecture Notes in Computer Science > Developments in Language Theory > Invited Presentations > 95-110
Lecture Notes in Computer Science > FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science > Contributions > 164-175
Lecture Notes in Computer Science > Computer Science Logic > Automata > 355-368
Lecture Notes in Computer Science > STACS 98 > 607-617
Lecture Notes in Computer Science > Theory and Applications of Satisfiability Testing – SAT 2010 > Part 2. Regular Papers > 30-43
Lecture Notes in Computer Science > Theory and Applications of Satisfiability Testing > Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables > 30-45
Lecture Notes in Computer Science > STACS 94 > 449-460
Lecture Notes in Computer Science > Computer Science Logic > Complexity and Proof Complexity > 412-426
Archive for Mathematical Logic > 2015 > 54 > 5-6 > 685-710
Journal of Logic, Language and Information > 2015 > 24 > 3 > 289-305
Studia Logica > 2013 > 101 > 2 > 343-366
Theoretical Computer Science > 2012 > 417 > Complete > 36-49
Archive for Mathematical Logic > 2011 > 50 > 7-8 > 727-742
Theory of Computing Systems > 2010 > 47 > 2 > 454-490