Relative complexity of algebras
From MaRDI portal
Publication:3928239
DOI10.1007/BF01752396zbMATH Open0473.68031OpenAlexW1983075368MaRDI QIDQ3928239FDOQ3928239
Authors: Edward K. Blum, Nancy 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
General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- A difference in expressive power between flowcharts and recursion schemes
- Abstract data types and software validation
- Title not available (Why is that?)
- Data encodings and their costs
- Title not available (Why is that?)
- Relative complexity of operations on numeric and bit-string algebras
- Efficient searching using partial ordering
- Straight-line program length as a parameter for complexity analysis
- Space and Time Hierarchies for Classes of Control Structures and Data Structures
- Straight-line program length as a parameter for complexity measures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal Modeling of Virtual Machines
Cited In (6)
- Instruction sequence processing operators
- Relative complexity of operations on numeric and bit-string algebras
- A difference in expressive power between flowcharts and recursion schemes
- Implementation of data types by algebraic methods
- Necessary and sufficient conditions for the universality of programming formalisms
- A view of computability on term algebras
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)
