Alternating time versus deterministic time: A separation (Q4717057): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Time- and tape-bounded Turing acceptors and AFLs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy for nondeterministic time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speedups of deterministic machines by synchronous parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time Versus Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proving time constructibility of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternation. II. A graph theoretic approach to determinism versus nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Turing machine time hierarchy / rank
 
Normal rank

Revision as of 15:59, 24 May 2024

scientific article; zbMATH DE number 951912
Language Label Description Also known as
English
Alternating time versus deterministic time: A separation
scientific article; zbMATH DE number 951912

    Statements

    Identifiers