The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Alternation
Open accessAbstract
Alternation is a generalization of nondeterminism in which existential and universal quantitiers can alternate during the course of a computation, whereas in a nondeterministic computation there are only existential quantifiers.Alternating Turing machines are defined and shown to accept precisely the recursively enumerable sets.Complexity classes of languages accepted by time-(space-) bounded alternating Turing machines are characterized in terms of complexity classes of languages accepted by space-(time-) bounded deterministic Turing machines.In particular, alternating polynomial time is equivalent to deterministic polynomial space and alternating polynomial space is equivalent to deterministic 'exponential time.Subrecursive quantifier hierarchies are defined in terms of time-or space-bounded alternating Tufing machines by bounding the number of alternations allowed during computations.Alternating finite-state automata are defined and shown to accept only regular languages, although, in general, 2 2 states are necessary and sufficient to simulate a k-state alternating finite automaton deterministically.Finally, it is shown that alternating pushdown automata are strictly more powerful than nondeterministic pushdown automata.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Finite Automata and Their Decision Problems
Rabin, M. O., & Scott, D. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.32.0114 · Cited by 1,879
Relationships between nondeterministic and deterministic tape complexities
Savitch, W. J. (1970) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(70)80006-x · Cited by 1,366
Propositional dynamic logic of regular programs
Fischer, M. J., & Ladner, R. E. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90046-1 · Cited by 1,364
Stockmeyer, L. J. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90061-x · Cited by 1,293
Self-citationFormal Languages and their Relation to Automata
Morris, J. B. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19706 · Cited by 998
Complete sets and the polynomial-time hierarchy
Wrathall, C. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90062-1 · Cited by 394
Rota, G. (1977) · Advances in Mathematics · doi:10.1016/0001-8708(77)90111-6 · Cited by 149
Cited by
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Alternating-time temporal logic
Alur, R., Henzinger, T. A., & Kupferman, O. (2002) · Journal of the ACM · doi:10.1145/585265.585270 · Cited by 1,394
Algorithms, games, and the internet
Papadimitriou, C. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380883 · Cited by 1,085
Parity, circuits, and the polynomial-time hierarchy
Furst, M., Saxe, J. B., & Sipser, M. (1984) · Mathematical Systems Theory · doi:10.1007/bf01744431 · Cited by 938
A guide to completeness and complexity for modal logics of knowledge and belief
Halpern, J. Y., & Moses, Y. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90049-4 · Cited by 845
Nisan, N., & Wigderson, A. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80043-1 · Cited by 808
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
An automata-theoretic approach to linear temporal logic
Vardi, M. Y. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60915-6_6 · Cited by 660
A taxonomy of problems with fast parallel algorithms
Cook, S. A. (1985) · Information and Control · doi:10.1016/s0019-9958(85)80041-3 · Cited by 641
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
Babai, L., & Moran, S. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90028-1 · Cited by 589
A calculus for access control in distributed systems
Abadi, M., Burrows, M., Lampson, B., & Plotkin, G. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/155183.155225 · Cited by 575
Model Checking of Safety Properties
Kupferman, O., & Vardi, M. Y. (2001) · Formal Methods in System Design · doi:10.1023/a:1011254632723 · Cited by 566
A Catalog of Complexity Classes
JOHNSON, D. S. (1990) · Algorithms and Complexity · doi:10.1016/b978-0-444-88071-0.50007-2 · Cited by 556
Languages that Capture Complexity Classes
Immerman, N. (1987) · SIAM Journal on Computing · doi:10.1137/0216051 · Cited by 546
The complexity of stochastic games
Condon, A. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90048-k · Cited by 517
The Complexity of Optimal Queuing Network Control
Papadimitriou, C. H., & Tsitsiklis, J. N. (1999) · Mathematics of Operations Research · doi:10.1287/moor.24.2.293 · Cited by 469
The complexity of optimization problems
Krentel, M. W. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90039-6 · Cited by 441
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Barrington, D. A. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90037-8 · Cited by 411
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Complexity classes in communication complexity theory
Babai, L., Frankl, P., & Simon, J. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.15 · Cited by 307
The complexity of reasoning about knowledge and time. I. Lower bounds
Halpern, J. Y., & Vardi, M. Y. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90039-1 · Cited by 252
Reasoning about Cognitive Trust in Stochastic Multiagent Systems
Huang, X., Kwiatkowska, M., & Olejnik, M. (2019) · ACM Transactions on Computational Logic · doi:10.1145/3329123 · Cited by 18
Metadata
- Authors
- Chandra, A. K., Kozen, D. C., & Stockmeyer, L. J.
- Venue
- Journal of the ACM
- Published
- 1981-01
- Volume
- 28
- Issue
- 1
- Pages
- 114-133
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W4241108585
- Cited by
- 1,221
- References
- 13
- FWCI
- 30.69
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.