Verifying whether one-tape Turing machines run in linear time (Q2009635): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2019.08.004 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2967571932 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.0496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial game problems require Ω( <i> n <sup>k</sup> </i> ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nontrivial lower bounds for the least common multiple of some finite sequences of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying time complexity of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of One-Tape Turing Machine Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical hierarchy and complexity of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of one-tape nondeterministic Turing machine time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An NP-complete language accepted in linear time by a one-tape Turing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5192993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of one-tape linear-time Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Turing machine time hierarchy / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127356913 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2019.08.004 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:27, 16 December 2024

scientific article
Language Label Description Also known as
English
Verifying whether one-tape Turing machines run in linear time
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references