Topic
Alternating Turing machine
About: Alternating Turing machine is a research topic. Over the lifetime, 372 publications have been published within this topic receiving 7910 citations. The topic is also known as: Alternating Turing Machine, ATM.
Papers published on a yearly basis
Papers
TL;DR: Turing machine space complexity is related to circuit depth complexity, which complements the known connection between Turing machine time and circuit size, thus enabling the related nature of some important open problems concerning Turing machine and circuit complexity to be exposed.
Abstract: Turing machine space complexity is related to circuit depth complexity. The relationship complements the known connection between Turing machine time and circuit size, thus enabling us to expose the related nature of some important open problems concerning Turing machine and circuit complexity. We are also able to show some connection between Turing machine complexity and arithmetic complexity.
402 citations
6 Oct 1965
TL;DR: The computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines is investigated and a "translational" method which escapes some of the limitations of earlier approaches leads to a refinement of the established hierarchy.
Abstract: This paper investigates the computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines. A "translational" method which escapes some of the limitations of earlier approaches leads to a refinement of the established hierarchy. The previous complexity classes are shown to possess certain translational properties. An related hierarchy of complexity classes of monotonic functions is examined
387 citations
TL;DR: It is shown by pure counting arguments that BPP is contained in ΣP2, the second level of the hierarchy of the polynomial hierarchy of Meyer and Stockmeyer.
277 citations
Book•
1 Jan 1986
TL;DR: A comparison of circuit-size complexity and Probabilistic Algorithms for sparse sets and oracles shows that the former are superior to the latter in both the low and high hierarchies.
Abstract: Preliminaries.- Circuit-size complexity.- Probabilistic Algorithms.- Sparse sets.- The low and high hierarchies.- Oracles.
193 citations
TL;DR: A modified time complexity measure UTIME of Turing machines computations which is sensitive to multiplication by constants is introduced and the results concerning languages over one- and two-letter alphabets are refined.
179 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 2 |
| 2019 | 1 |
| 2018 | 3 |
| 2017 | 5 |
| 2016 | 5 |
| 2015 | 5 |