Heribert Vollmer

From MaRDI portal
Person:208765

Available identifiers

zbMath Open vollmer.heribertWikidataQ102300807 ScholiaQ102300807MaRDI QIDQ208765

List of research outcomes

PublicationDate of PublicationType
A logical characterization of constant-depth circuits over the reals2022-06-24Paper
Descriptive complexity of \#P functions: a new perspective2021-01-22Paper
Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth2021-01-20Paper
Expressivity and Complexity of Dependence Logic2020-02-04Paper
Satisfiability of Modal Inclusion Logic2019-11-22Paper
A complexity theory for hard enumeration problems2019-09-19Paper
A model-theoretic characterization of constant-depth arithmetic circuits2019-09-18Paper
https://portal.mardi4nfdi.de/entity/Q45848922018-09-04Paper
https://portal.mardi4nfdi.de/entity/Q46363022018-04-23Paper
Complexity of Propositional Logics in Team Semantic2018-03-22Paper
Modal independence logic:2018-02-13Paper
https://portal.mardi4nfdi.de/entity/Q53519632017-08-31Paper
Paradigms for parameterized enumeration2017-08-15Paper
https://portal.mardi4nfdi.de/entity/Q52784062017-07-19Paper
A complexity theory for hard enumeration problems2017-06-01Paper
A model-theoretic characterization of constant-depth arithmetic circuits2016-09-09Paper
Dependence logic with a majority quantifier2016-07-04Paper
Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting2016-05-11Paper
Parameterized Enumeration for Modification Problems2016-04-08Paper
https://portal.mardi4nfdi.de/entity/Q34572002015-12-11Paper
The tractability of model checking for LTL2015-09-17Paper
LoCo—A Logic for Configuration Problems2015-09-17Paper
Complexity of Propositional Independence and Inclusion Logic2015-09-16Paper
Modal Inclusion Logic: Being Lax is Simpler than Being Strict2015-09-16Paper
LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY2015-04-29Paper
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments2015-03-23Paper
A Fragment of Dependence Logic Capturing Polynomial Time2014-09-05Paper
Paradigms for Parameterized Enumeration2013-09-20Paper
Extended Modal Dependence Logic $\mathcal{EMDL}$2013-09-17Paper
Model Checking for Modal Dependence Logic: An Approach through Post’s Lattice2013-09-17Paper
Parameterized Complexity of Weighted Satisfiability Problems2013-08-12Paper
Complexity results for modal dependence logic2013-06-13Paper
Complexity classifications for different equivalence and audit problems for Boolean circuits2012-10-22Paper
https://portal.mardi4nfdi.de/entity/Q29116292012-08-31Paper
The complexity of problems for quantified constraints2010-10-06Paper
On Second-Order Monadic Monoidal and Groupoidal Quantifiers2010-09-21Paper
Complexity Results for Modal Dependence Logic2010-09-03Paper
Bases for Boolean co-clones2009-12-18Paper
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis2009-08-06Paper
The complexity of satisfiability problems: Refining Schaefer's theorem2009-04-30Paper
The Complexity of Generalized Satisfiability for Linear Temporal Logic2009-04-29Paper
Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?2009-01-22Paper
On Second-Order Monadic Groupoidal Quantifiers2008-07-10Paper
Computational Complexity of Constraint Satisfaction2007-11-13Paper
STACS 20042007-10-01Paper
The Complexity of Generalized Satisfiability for Linear Temporal Logic2007-09-07Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
The many faces of a translation2006-01-10Paper
Theory and Applications of Satisfiability Testing2005-12-16Paper
The complexity of base station positioning in cellular networks2005-05-04Paper
Functions computable in polynomial space2005-05-04Paper
Arithmetic Circuits and Polynomial Replacement Systems2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q48188502004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q47379112004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44724422004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45363692004-03-23Paper
Optimal satisfiability for propositional calculi and constraint satisfaction problems.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44520542004-02-11Paper
On the Autoreducibility of Random Sequences2004-01-08Paper
Generic separations and leaf languages2003-07-31Paper
https://portal.mardi4nfdi.de/entity/Q44118382003-07-10Paper
https://portal.mardi4nfdi.de/entity/Q47833182002-12-04Paper
https://portal.mardi4nfdi.de/entity/Q45364002002-06-25Paper
https://portal.mardi4nfdi.de/entity/Q27524662002-01-07Paper
https://portal.mardi4nfdi.de/entity/Q27542052001-11-11Paper
The descriptive complexity approach to LOGCFL2001-10-14Paper
UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS2001-05-20Paper
https://portal.mardi4nfdi.de/entity/Q27092382001-05-15Paper
https://portal.mardi4nfdi.de/entity/Q49553532001-05-08Paper
A note on closure properties of logspace MOD classes2000-10-26Paper
https://portal.mardi4nfdi.de/entity/Q49426282000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q49386482000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42510621999-11-15Paper
https://portal.mardi4nfdi.de/entity/Q42599981999-09-08Paper
Probabilistic type-2 operators and ``almost-classes1999-02-02Paper
Relating polynomial time to constant depth1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q43814031998-07-27Paper
Gap-languages and log-time complexity classes1998-06-30Paper
https://portal.mardi4nfdi.de/entity/Q43934841998-06-10Paper
The chain method to separate counting classes1998-04-20Paper
Nondeterministic \(NC^1\) computation1998-01-01Paper
Recursion theoretic characterizations of complexity classes of counting functions1997-09-10Paper
https://portal.mardi4nfdi.de/entity/Q43362771997-05-12Paper
On balanced versus unbalanced computation trees1996-08-05Paper
Complexity classes of optimization functions1996-04-16Paper
THE COMPLEXITY OF FINDING MIDDLE ELEMENTS1995-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42816991994-03-10Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Heribert Vollmer