Accessibility of values as a determinant of relative complexity in algebras (Q1167536): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(82)90058-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086411460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Time Trade-Offs in Structured Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-line program length as a parameter for complexity analysis / 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: Space and Time Hierarchies for Classes of Control Structures and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving Proximity in Arrays / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:30, 13 June 2024

scientific article
Language Label Description Also known as
English
Accessibility of values as a determinant of relative complexity in algebras
scientific article

    Statements

    Accessibility of values as a determinant of relative complexity in algebras (English)
    0 references
    0 references
    1982
    0 references
    straight-line program length
    0 references
    finitely generated algebra
    0 references
    general size parameter
    0 references
    relative expression assignment complexity
    0 references
    coding-independent lower bounds on computation time in ordinary programming languages
    0 references
    number of representations
    0 references

    Identifiers