Relationships between nondeterministic and deterministic tape complexities (Q2537313): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Between Time and Tape Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of computable functions defined by bounds on computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic simulation of non-deterministic turing machines (Detailed Abstract) / rank
 
Normal rank

Latest revision as of 00:12, 12 June 2024

scientific article
Language Label Description Also known as
English
Relationships between nondeterministic and deterministic tape complexities
scientific article

    Statements

    Identifiers