Relative complexity of operations on numeric and bit-string algebras (Q3923596): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nancy A. Lynch / rank
Normal rank
 
Property / author
 
Property / author: Nancy A. Lynch / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Simulation of Multihead Tape Units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-line program length as a parameter for complexity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A difference in expressive power between flowcharts and recursion schemes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:54, 13 June 2024

scientific article
Language Label Description Also known as
English
Relative complexity of operations on numeric and bit-string algebras
scientific article

    Statements

    Relative complexity of operations on numeric and bit-string algebras (English)
    0 references
    0 references
    0 references
    1980
    0 references
    computing power of various algebras
    0 references
    recursive power
    0 references
    partial recursive function
    0 references
    flowchart
    0 references
    polynomial time
    0 references
    reducibility relation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references