pith. sign in

Heribert Vollmer

Identifiers

  • name variant Heribert Vollmer 0.60 · backfill

Papers (24)

  1. Recurrent Graph Neural Networks and Arithmetic Circuits cs.CC · 2026 · author #5
  2. Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth cs.CC · 2017 · author #3
  3. A Complexity Theory for Hard Enumeration Problems cs.CC · 2016 · author #5
  4. Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics cs.LO · 2015 · author #4
  5. Complexity of Propositional Logics in Team Semantics cs.LO · 2015 · author #4
  6. A Van Benthem Theorem for Modal Team Semantics cs.LO · 2014 · author #4
  7. Modal Independence Logic cs.LO · 2014 · author #4
  8. Parameterized Enumeration with Ordering cs.CC · 2013 · author #6
  9. Paradigms for Parameterized Enumeration cs.CC · 2013 · author #5
  10. Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice cs.CC · 2013 · author #2
  11. On the Parameterized Complexity of Default Logic and Autoepistemic Logic cs.CC · 2011 · author #4
  12. Dependence logic with a majority quantifier cs.LO · 2011 · author #4
  13. Complexity Results for Modal Dependence Logic cs.LO · 2011 · author #2
  14. Complexity of Non-Monotonic Logics cs.CC · 2010 · author #2
  15. The Complexity of Reasoning for Fragments of Autoepistemic Logic cs.LO · 2010 · author #4
  16. The Complexity of Generalized Satisfiability for Linear Temporal Logic cs.LO · 2008 · author #5
  17. The Complexity of Propositional Implication cs.CC · 2008 · author #4
  18. The Complexity of Reasoning for Fragments of Default Logic cs.CC · 2008 · author #4
  19. Extensional Uniformity for Boolean Circuits cs.LO · 2008 · author #3
  20. The Complexity of Boolean Constraint Isomorphism cs.CC · 2003 · author #4
  21. Equivalence and Isomorphism for Boolean Constraint Satisfaction cs.CC · 2002 · author #4
  22. The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae cs.CC · 1998 · author #2
  23. A Generalized Quantifier Concept in Computational Complexity Theory cs.CC · 1998 · author #1
  24. The descriptive complexity approach to LOGCFL cs.CC · 1998 · author #4

Mentions

  • 1504.06409 #4 · backfill · confidence 0.70 Heribert Vollmer
  • 1504.06135 #4 · backfill · confidence 0.70 Heribert Vollmer
  • 1410.6648 #4 · backfill · confidence 0.70 Heribert Vollmer
  • 1404.0144 #4 · backfill · confidence 0.70 Heribert Vollmer
  • 1309.5009 #6 · backfill · confidence 0.70 Heribert Vollmer
  • 1306.2171 #5 · backfill · confidence 0.70 Heribert Vollmer
  • 1303.6424 #2 · backfill · confidence 0.70 Heribert Vollmer
  • 1110.0623 #4 · backfill · confidence 0.70 Heribert Vollmer
  • 1109.4750 #4 · backfill · confidence 0.70 Heribert Vollmer
  • 1104.0607 #2 · backfill · confidence 0.70 Heribert Vollmer
  • 1009.1990 #2 · backfill · confidence 0.70 Heribert Vollmer
  • 1006.0220 #4 · backfill · confidence 0.70 Heribert Vollmer
  • 0812.4848 #5 · backfill · confidence 0.70 Heribert Vollmer
  • 0811.0959 #4 · backfill · confidence 0.70 Heribert Vollmer
  • 0808.3884 #4 · backfill · confidence 0.70 Heribert Vollmer
  • 0805.4072 #3 · backfill · confidence 0.70 Heribert Vollmer

Frequent Coauthors