Cites work
- A difference in expressive power between flowcharts and recursion schemes
- Abstract data types and software validation
- Data encodings and their costs
- Efficient searching using partial ordering
- Formal Modeling of Virtual Machines
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3512082 (Why is no real title available?)
- scientific article; zbMATH DE number 3566140 (Why is no real title available?)
- scientific article; zbMATH DE number 3592966 (Why is no real title available?)
- scientific article; zbMATH DE number 3441605 (Why is no real title available?)
- scientific article; zbMATH DE number 3453105 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3381831 (Why is no real title available?)
- Relative complexity of operations on numeric and bit-string algebras
- Space and Time Hierarchies for Classes of Control Structures and Data Structures
- Straight-line program length as a parameter for complexity analysis
- Straight-line program length as a parameter for complexity measures
- The complexity of theorem-proving procedures
Cited in
(6)- A view of computability on term algebras
- A difference in expressive power between flowcharts and recursion schemes
- Relative complexity of operations on numeric and bit-string algebras
- Instruction sequence processing operators
- Implementation of data types by algebraic methods
- Necessary and sufficient conditions for the universality of programming formalisms
This page was built for publication: Relative complexity of algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3928239)
