15 results on '"Heribert Vollmer"'
Search Results
2. Counting Classes and the Fine Structure between NC1 and L.
3. The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments.
4. The Complexity of Problems for Quantified Constraints.
5. The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis.
6. The Complexity of Generalized Satisfiability for Linear Temporal Logic.
7. Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation
8. The Complexity of Satisfiability Problems: Refining Schaefer's Theorem
9. Functions Computable in Polynomial Space
10. On the Autoreducibility of Random Sequences
11. The Descriptive Complexity Approach to LOGCFL
12. The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
13. Characterizing Small Depth and Small Space Classes by Operators of Higher Types
14. Lindstroem Quantifiers and Leaf Language Definability
15. Probabilistic Type-2 Operators and 'Almost'-Classes
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.