The complexity of total order structures

DOI10.1016/0022-0000(78)90008-9MaRDI QIDQ1253249zbMATH OpenOpenAlexFDO

Authors Dan Moore, John Case

Publication date 1978

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(78)90008-9

zbMATH Keywords

Computational ComplexityRecursive FunctionRecursively Enumerable SetsSpeedupTotal Order

Mathematics Subject Classification ID

Total orders (06A05) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites work

• scientific article; zbMATH DE number 3501008 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3292869 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computational speed-up by effective operators
• On Almost Everywhere Complex Recursive Functions
• On complexity properties of recursively enumerable sets
• On the Computational Complexity of Algorithms
• Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders
• Speed-Ups by changing the order in which sets are enumerated
• Toward a Theory of Enumerations

This page was built for publication: The complexity of total order structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1253249)