Squeezing Feasibility

DOI10.1007/978-3-319-40189-8_8zbMath1476.03052OpenAlexW4245888770MaRDI QIDQ3188242

Walter Dean

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40189-8_8

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

Related Items

Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer

Cites Work

• Church's thesis and the ideal of informal rigour
• Space measures for storage modification machines
• Time bounded random access machines
• Fast multiplication of large numbers
• Faster Integer Multiplication
• An overview of computational complexity
• Storage Modification Machines
• Time Bounded Random Access Machines with Parallel Processing
• Computational Complexity
• On the Computational Complexity of Algorithms
• On the Minimum Computation Time of Functions
• Which number theoretic problems can be solved in recursive progressions on Π₁¹-paths through O?
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item