Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007996154/catalog> ?p ?o. }
Showing items 1 to 20 of
20
with 100 items per page.
- catalog contributor b11091671.
- catalog contributor b11091672.
- catalog created "1998.".
- catalog date "1998".
- catalog date "1998.".
- catalog dateCopyrighted "1998.".
- catalog description "Includes bibliographical references and index.".
- catalog description "pt. 1. Fundamentals. 1. Introduction. 2. Information-Based Complexity. 3. Breaking the Curse of Dimensionality -- pt. 2. Some Interesting Topics. 4. Very High-Dimensional Integration and Mathematical Finance. 5. Complexity of Path Integration. 6. Are Ill-Posed Problems Solvable? 7. Complexity of Nonlinear Problems. 8. What Model of Computation Should Be Used by Scientists? 9. Do Impossibility Theorems from Formal Models Limit Scientific Knowledge? 10. Complexity of Linear Programming. 11. Complexity of Verification. 12. Complexity of Implementation Testing. 13. Noisy Information. 14. Value of Information in Computation. 15. Assigning Values to Mathematical Hypotheses. 16. Open Problems.".
- catalog extent "xii, 139 p. :".
- catalog identifier "0521480051 (hardbound)".
- catalog issued "1998".
- catalog issued "1998.".
- catalog language "eng".
- catalog publisher "New York : Cambridge University Press,".
- catalog subject "511.3 21".
- catalog subject "Computational complexity.".
- catalog subject "QA267.7 .T7 1998".
- catalog tableOfContents "pt. 1. Fundamentals. 1. Introduction. 2. Information-Based Complexity. 3. Breaking the Curse of Dimensionality -- pt. 2. Some Interesting Topics. 4. Very High-Dimensional Integration and Mathematical Finance. 5. Complexity of Path Integration. 6. Are Ill-Posed Problems Solvable? 7. Complexity of Nonlinear Problems. 8. What Model of Computation Should Be Used by Scientists? 9. Do Impossibility Theorems from Formal Models Limit Scientific Knowledge? 10. Complexity of Linear Programming. 11. Complexity of Verification. 12. Complexity of Implementation Testing. 13. Noisy Information. 14. Value of Information in Computation. 15. Assigning Values to Mathematical Hypotheses. 16. Open Problems.".
- catalog title "Complexity and information / J.F. Traub, A.G. Werschulz.".
- catalog type "text".