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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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 / 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: Q3751011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tape versus queue and stacks: The lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385509 / 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: On-line simulation of k + 1 tapes by k tapes requires nonlinear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Komplexität von Sortierproblemen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(93)90194-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073510698 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:23, 30 July 2024

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

    Statements

    The complexity of matrix transposition on one-tape off-line Turing machines with output tape (English)
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    Kolmogorov complexity
    0 references
    matrix transposition
    0 references
    Boolean matrices
    0 references
    Turing machines
    0 references
    optimal lower bound
    0 references

    Identifiers