The following pages link to Heribert Vollmer (Q208765):
Displaying 21 items.
- LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY (Q5248979) (← links)
- Descriptive Complexity of #AC^0 Functions (Q5278406) (← links)
- STACS 2004 (Q5309697) (← links)
- A Van Benthem Theorem for Modal Team Semantics (Q5351963) (← links)
- Computational Complexity of Constraint Satisfaction (Q5425380) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492848) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Theory and Applications of Satisfiability Testing (Q5714771) (← links)
- The Complexity of Generalized Satisfiability for Linear Temporal Logic (Q5758057) (← links)
- Automata theory and its applications (Q5936849) (← links)
- Complexity bounds on general hard-core predicates. (Q5944107) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)
- Reversible Boolean networks. II: Phase transitions, oscillations, and local structures (Q5946575) (← links)
- Darwin among the machines: The evolution of global intelligence. Transl. from the American by Friedrich Griese (Q5947998) (← links)
- Polynomial expansions of Boolean functions in images of nonhomogeneous operators (Q5951301) (← links)
- Average case complexity for finite Boolean functions (Q5954082) (← links)
- Lower bounds for the complexity of restrictions of Boolean functions (Q5954083) (← links)
- An upper bound on the number of iterations for transforming a Boolean function of degree greater or equal than 4 to a function of degree 3 (Q5960285) (← links)
- Relations among parallel and sequential computation models (Q6560351) (← links)
- Enumeration classes defined by circuits (Q6584035) (← links)
- Parameterized complexity of weighted team definability (Q6620025) (← links)
