Relative complexity of algebras

DOI10.1007/BF01752396zbMath0473.68031OpenAlexW1983075368MaRDI QIDQ3928239

Edward K. Blum, Nancy A. Lynch

Publication date: 1981

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01752396

zbMATH Keywords

algebraic model for measuring the relative complexity of programming systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)

Related Items (6)

A difference in expressive power between flowcharts and recursion schemes ⋮ Instruction sequence processing operators ⋮ Relative complexity of operations on numeric and bit-string algebras ⋮ A view of computability on term algebras ⋮ Implementation of data types by algebraic methods ⋮ Necessary and sufficient conditions for the universality of programming formalisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data encodings and their costs
• Efficient searching using partial ordering
• Straight-line program length as a parameter for complexity analysis
• A difference in expressive power between flowcharts and recursion schemes
• Relative complexity of operations on numeric and bit-string algebras
• Space and Time Hierarchies for Classes of Control Structures and Data Structures
• Formal Modeling of Virtual Machines
• Abstract data types and software validation
• Straight-line program length as a parameter for complexity measures
• The complexity of theorem-proving procedures

This page was built for publication: Relative complexity of algebras