Squeezing Feasibility (Q3188242)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Squeezing Feasibility	scientific article

Statements

scholarly article

0 references

Squeezing Feasibility (English)

0 references

0 references

Pursuit of the Universal

0 references

publication date

17 August 2016

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-40189-8_8

0 references

Computational Complexity

0 references

0 references

0 references

0 references

0 references

An overview of computational complexity

0 references

On the Minimum Computation Time of Functions

0 references

Time bounded random access machines

0 references

Faster Integer Multiplication

0 references

0 references

On the Computational Complexity of Algorithms

0 references

0 references

0 references

Which number theoretic problems can be solved in recursive progressions on Π<sub>1</sub><sup>1</sup>-paths through <i>O</i>?

0 references

Church's thesis and the ideal of informal rigour

0 references

0 references

Time Bounded Random Access Machines with Parallel Processing

0 references

Storage Modification Machines

0 references

Fast multiplication of large numbers

0 references

On Computable Numbers, with an Application to the Entscheidungsproblem

0 references

Space measures for storage modification machines

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-40189-8_8

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3188242

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3188242&oldid=36267857"