The following pages link to Heribert Vollmer (Q208765):
Displaying 50 items.
- Dependence logic with a majority quantifier (Q302214) (← links)
- Branching-time logics with path relativisation (Q386037) (← links)
- The equivalence of tree adjoining grammars and monadic linear context-free tree grammars (Q438589) (← links)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- Computability and complexity theory. (Q640476) (← links)
- Minesweeper may not be NP-complete but is hard nonetheless (Q660171) (← links)
- Finite model theory and its applications. (Q703863) (← links)
- Elements of finite model theory. (Q703864) (← links)
- Relative randomness and cardinality (Q985004) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- Bases for Boolean co-clones (Q1044708) (← links)
- Choiceless polynomial time (Q1125059) (← links)
- Relating polynomial time to constant depth (Q1274992) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Probabilistic type-2 operators and ``almost''-classes (Q1277097) (← links)
- Recursion theoretic characterizations of complexity classes of counting functions (Q1365942) (← links)
- (Q1384715) (redirect page) (← links)
- The chain method to separate counting classes (Q1384716) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- A descriptive characterisation of even linear languages (Q1430213) (← links)
- On the logic of acceptance and rejection (Q1577347) (← links)
- A note on closure properties of logspace MOD classes (Q1583060) (← links)
- The complexity of base station positioning in cellular networks (Q1775056) (← links)
- Functions computable in polynomial space (Q1775891) (← links)
- Reflectiveness and compression of threshold transformations (Q1841890) (← links)
- Approximating CVP to within almost-polynomial factors is NP-hard (Q1878613) (← links)
- Complexity classes of optimization functions (Q1898460) (← links)
- Complexity results for modal dependence logic (Q1956378) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461) (← links)
- Separation of the monotone NC hierarchy (Q1977414) (← links)
- A logical characterization of constant-depth circuits over the reals (Q2148775) (← links)
- Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
- The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200) (← links)
- A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- Paradigms for parameterized enumeration (Q2398214) (← links)
- Lossless condensers, unbalanced expanders, and extractors (Q2460624) (← links)
- The many faces of a translation (Q2581761) (← links)
- (Q2709238) (← links)
- (Q2752466) (← links)
- (Q2754205) (← links)
- On Second-Order Monadic Monoidal and Groupoidal Quantifiers (Q2786142) (← links)
- Parameterized Enumeration for Modification Problems (Q2799203) (← links)
- Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting (Q2805407) (← links)
- Parameterized Complexity of Weighted Satisfiability Problems (Q2843338) (← links)
- Extended Modal Dependence Logic $\mathcal{EMDL}$ (Q2849427) (← links)
- Model Checking for Modal Dependence Logic: An Approach through Post’s Lattice (Q2849435) (← links)
- Paradigms for Parameterized Enumeration (Q2849918) (← links)
