Space complexity in on-line computation (Q1167539): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast on-line integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition time of context-free languages by on-line Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Recognition of Primes by Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two memory bounds for the recognition of primes by automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark on Acceptable Sets of Numbers / rank
 
Normal rank

Latest revision as of 16:30, 13 June 2024

scientific article
Language Label Description Also known as
English
Space complexity in on-line computation
scientific article

    Statements

    Space complexity in on-line computation (English)
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    on-line Turing machine
    0 references
    linear space
    0 references
    recognition of powers of 3
    0 references
    integer multiplication
    0 references
    object code generation
    0 references
    0 references