Accessibility of values as a determinant of relative complexity in algebras

DOI10.1016/0022-0000(82)90058-7zbMath0491.68044OpenAlexW2086411460MaRDI QIDQ1167536

Nancy A. Lynch

Publication date: 1982

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(82)90058-7

zbMATH Keywords

number of representationsfinitely generated algebracoding-independent lower bounds on computation time in ordinary programming languagesgeneral size parameterrelative expression assignment complexitystraight-line program length

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Theory of software (68N99)

Cites Work

• Straight-line program length as a parameter for complexity analysis
• Space-Time Trade-Offs in Structured Programming
• Preserving Proximity in Arrays
• Space and Time Hierarchies for Classes of Control Structures and Data Structures
• Straight-line program length as a parameter for complexity measures

This page was built for publication: Accessibility of values as a determinant of relative complexity in algebras