Complexity lower bounds for machine computing models (Q1057651): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Q937901 / rank
Normal rank
 
Property / author
 
Property / author: Anatoly Petrivich Beltiukov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy for nondeterministic time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimum Computation Time of Functions / 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: On-Line Turing Machine Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time Versus Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of Turing machines with restricted tape alphabet size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tape bounds for time-bounded Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Among Complexity Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real time computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating refined space complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3854629 / rank
 
Normal rank

Latest revision as of 17:34, 14 June 2024

scientific article
Language Label Description Also known as
English
Complexity lower bounds for machine computing models
scientific article

    Statements

    Complexity lower bounds for machine computing models (English)
    0 references
    0 references
    1985
    0 references
    Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 118, 4-24 (Russian) (1982; Zbl 0494.68058).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    sorting on RAM
    0 references
    on-line computations
    0 references
    tails
    0 references
    time-space trade-off
    0 references