Complexity Estimates Depending on Condition and Round-off Error: Complexity estimates depending on condition and round-off error.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Complexity Estimates Depending on Condition and Round-off Error: Complexity estimates depending on condition and round-off error.
Συγγραφείς: Steve Smale, Felipe Cucker
Πηγή: Lecture Notes in Computer Science ISBN: 9783540648482
Στοιχεία εκδότη: World Scientific Publishing Company, 1998.
Έτος έκδοσης: 1998
Θεματικοί όροι: Complexity and performance of numerical algorithms, Roundoff error, Analysis of algorithms and problem complexity, Numerical computation of solutions to single equations, Models of computation (Turing machines, etc.), 0101 mathematics, 01 natural sciences
Περιγραφή: This paper has two agendas. One is to develop the foundations of round-off in computation. The other is to describe an algorithm for deciding feasibility for polynomial systems of equations and inequalities together with its complexity analysis and its round-off properties. Each role reinforces the other.
Τύπος εγγράφου: Part of book or chapter of book
Article
Περιγραφή αρχείου: application/xml
ISSN: 1557-735X
0004-5411
DOI: 10.1142/9789812792839_0029
DOI: 10.1007/3-540-68530-8_10
DOI: 10.1145/300515.300519
Σύνδεσμος πρόσβασης: https://rd.springer.com/chapter/10.1007/3-540-68530-8_10
https://doi.org/10.1145/300515.300519
https://link.springer.com/chapter/10.1007/3-540-68530-8_10
https://dblp.uni-trier.de/db/journals/jacm/jacm46.html#CuckerS99
https://dl.acm.org/doi/10.1145/300515.300519
https://dblp.uni-trier.de/db/conf/esa/esa98.html#CuckerS98
Rights: URL: https://www.acm.org/publications/policies/copyright_policy#Background
Αριθμός Καταχώρησης: edsair.doi.dedup.....4b51d11d191fa5a5d56aca3e52a473b0
Βάση Δεδομένων: OpenAIRE
Περιγραφή
ISSN:1557735X
00045411
DOI:10.1142/9789812792839_0029