The complexity of matrix transposition on one-tape off-line Turing machines (Q808247): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The speed of copying on one-tape off-line turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of matrix transposition on one-tape off-line Turing machines with output tape / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / 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: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time Versus Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4766586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3051378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line simulation of k + 1 tapes by k tapes requires nonlinear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rangierkomplexität von Permutationen / rank
 
Normal rank

Latest revision as of 18:15, 21 June 2024

scientific article
Language Label Description Also known as
English
The complexity of matrix transposition on one-tape off-line Turing machines
scientific article

    Statements