Relativized alternation and space-bounded computation
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Logic at Botik'89 Symposium on logical foundations of computer science
Complexity classes defined by counting quantifiers
Journal of the ACM (JACM)
Linear Time Algorithms and NP-Complete Problems
SIAM Journal on Computing
On quasilinear-time complexity theory
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Nondeterministic stack register machines
Theoretical Computer Science
Rudimentary relations and primitive recursion: a toolbox
Theoretical Computer Science
Monadic logical definability of nondeterministic linear time
Computational Complexity
Satisfiability Is Quasilinear Complete in NQL
Journal of the ACM (JACM)
Sub-elementary classes of functions and relations.
Sub-elementary classes of functions and relations.
On the expressive power of monadic least fixed point logic
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Extensions of MSO and the monadic counting hierarchy
Information and Computation
Observations on complete sets between linear time and polynomial time
Information and Computation
| Hi-index | 0.01 |
In this paper, we investigate several extensions of the linear time hierarchy (denoted by LTH). We first prove that it is not necessary to erase the oracle tape between two successive oracle calls, thereby lifting a common restriction on LTH machines. We also define a natural counting extension of LTH and show that it corresponds to a robust notion of counting bounded arithmetic predicates. Finally, we show that the computational power of the majority operator is equivalent to that of the exact counting operator in both contexts.