Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,137,844 papers from all fields of science
Search
Sign In
Create Free Account
Alternating Turing machine
Known as:
Alternating computation
, Existential state
, Alternation
Expand
In computational complexity theory, an alternating Turing machine (ATM) is a non-deterministic Turing machine (NTM) with a rule for accepting…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
27 relations
2-EXPTIME
AC (complexity)
Boolean satisfiability problem
Co-NP
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Time, chance and quantum theory
A. Sudbery
2016
Corpus ID: 118602625
I propose an understanding of Everett and Wheeler's relative-state interpretation of quantum mechanics, which restores the…
Expand
2010
2010
Dynamical Aspects of Macroscopic and Quantum Transitions due to Coherence Function and Time Series Events
E. Bakhoum
,
C. Toma
2010
Corpus ID: 43079113
This study presents the application of dynamical equations able to generate alternating deformations with increasing amplitude…
Expand
Highly Cited
2009
Highly Cited
2009
TIDAL DISRUPTION, GLOBAL MASS FUNCTION, AND STRUCTURAL PARAMETER EVOLUTION IN STAR CLUSTERS
M. Trenti
,
E. Vesperini
,
M. Pasquato
2009
Corpus ID: 118626384
We present a unified picture for the evolution of star clusters on the two-body relaxation timescale. We use direct N-body…
Expand
Highly Cited
1997
Highly Cited
1997
Time scale analysis of an ATM queueing system with long-range dependent traffic
G. Mayor
,
J. Silvester
Proceedings of INFOCOM '97
1997
Corpus ID: 15545974
Several types of network traffic have been shown to exhibit long-range dependence (LRD). In this work, we show that the busy…
Expand
1997
1997
Programming with Logical Queries, Bulk Updates, and Hypothetical Reasoning
Weidong Chen
IEEE Transactions on Knowledge and Data…
1997
Corpus ID: 14300902
The paper presents a language of update programs that integrates logical queries, bulk updates and hypothetical reasoning in a…
Expand
1997
1997
On the maximum lengths of Davenport-Schinzel sequences
Martin Klazar
Contemporary Trends in Discrete Mathematics
1997
Corpus ID: 12409419
The quantity N5(n) is the maximum length of a finite sequence over n symbols which has no two identical consecutive elements and…
Expand
1996
1996
Performance Evaluation of Wireless Multimedia CDMA Networks Using Adaptive Transmission Control
Jianming Wu
,
R. Kohno
IEEE J. Sel. Areas Commun.
1996
Corpus ID: 206445304
When multimedia information including speech, image, data etc. are transmitted, the difference in information rates, required…
Expand
1993
1993
Efficient Use of Protocol Stacks for LAN/MAN-ATM Interworking
I. Venieris
,
J. Angelopoulos
,
G. Stassinopoulos
IEEE J. Sel. Areas Commun.
1993
Corpus ID: 6706882
Connectionless (CL) services as already developed in LANs, have to interwork with emerging asynchronous transfer mode (ATM…
Expand
1993
1993
Internal charge‐phosphor field characteristics of alternating‐current thin‐film electroluminescent devices
A. Abu-Dayah
,
S. Kobayashi
,
J. Wager
1993
Corpus ID: 2735060
The internal charge versus phosphor field (Q–Fp) technique is proposed as a method for characterization of the electrical…
Expand
1990
1990
Reversal Complexity Classes for Alternating Turing Machines
Mirosław Kutyłowski
,
M. Liskiewicz
,
Krzysztof Lorys
SIAM journal on computing (Print)
1990
Corpus ID: 207052306
Alternating Turing machines (ATMs) with bounded number of reversals are considered. It is proved that the machines making fewer…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required