Squeezing Feasibility

DOI10.1007/978-3-319-40189-8_8MaRDI QIDQ3188242zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An operational measure for squeezing
• Principles and Practice of Constraint Programming – CP 2004
• Squeezing arguments
• The feasibility pump
• scientific article; zbMATH DE number 1305705
• Boosting the feasibility pump
• Squeezing the Sierpiński sponge
• scientific article; zbMATH DE number 1163815
• The problem of constrained impact

Cites work

• An overview of computational complexity
• Church's thesis and the ideal of informal rigour
• Computational Complexity
• Fast multiplication of large numbers
• Faster integer multiplication
• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 3986645 (Why is no real title available?)
• scientific article; zbMATH DE number 4059391 (Why is no real title available?)
• scientific article; zbMATH DE number 3728250 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 1142308 (Why is no real title available?)
• scientific article; zbMATH DE number 953683 (Why is no real title available?)
• scientific article; zbMATH DE number 3305097 (Why is no real title available?)
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the Computational Complexity of Algorithms
• On the Minimum Computation Time of Functions
• Space measures for storage modification machines
• Storage Modification Machines
• Time bounded random access machines
• Time Bounded Random Access Machines with Parallel Processing
• Which number theoretic problems can be solved in recursive progressions on Π₁¹-paths through O?

Cited in

(2)

• Universality, invariance, and the foundations of computational complexity in the light of the quantum computer
• Dynamic evolution of squeezing maintenance

This page was built for publication: Squeezing Feasibility

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