Introduction to Circuit Complexity
- H. Vollmer
- Computer ScienceTexts in Theoretical Computer Science. An EATCS…
Introduction to Circuit Complexity: A Uniform Approach
- H. Vollmer
- Computer Science
- 1 December 2010
Nondeterministic NC1 Computation
- H. Caussinus, P. McKenzie, D. Thérien, H. Vollmer
- MathematicsJournal of computer and system sciences (Print)
- 24 May 1996
It is proved that boolean circuits, algebraic circuits, programs over nondeterministic finite automata, and programs over constant integer matrices yield equivalent definitions of the latter three classes, and closure properties are investigated.
The complexity of satisfiability problems: Refining Schaefer's theorem
Partially-Ordered Two-Way Automata: A New Characterization of DA
- T. Schwentick, D. Thérien, H. Vollmer
- Computer ScienceInternational Conference on Developments in…
- 16 July 2001
It is proved that partially-ordered 2-way DFAs recognize exactly the class UL of unambiguous languages introduced by Schutzenberger in 1976 and exactly those languages whose syntactic monoid is in DA.
On the power of polynomial time bit-reductions
- U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K. Wagner
- Mathematics Proceedings of the Eigth Annual Structure in…
- 18 May 1993
The question of how complex a leaf language must be in order to characterize some given class C is investigated, which leads to the examination of the closure of different language classes under bit-reducibility.
Bases for Boolean co-clones
A polynomial-time approximation scheme for base station positioning in UMTS networks
It is proved that for a particular specification of teletraffic (the so called demand node concept), this problem has a polynomial-time approximation scheme, but cannot have a fully polynomal time approximation scheme unless P = NP.
Nondeterministic NC 1 Computation.
It is proved that boolean circuits, algebraic circuits, programs over nondeterministic-nite automata, and programs over constant integer matrices yield equivalent deenitions of the latter three classes, and closure properties are investigated.
Lindström Quantifiers and Leaf Language Definability
- Hans-Jörg Burtschick, H. Vollmer
- PhilosophyInternational Journal of Foundations of Computer…
- 1 September 1998
Second-order Lindstrom quantifiers are introduced and analogies to the concept of leaf language definability are examined and the best up to now known leaf language characterization of the classes of the polynomial time hierarchy are tightened.