Complexity and Real Computation

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Introduction
3. Altmetric Badge
   Chapter 2 Definitions and First Properties of Computation
4. Altmetric Badge
   Chapter 3 Computation over a Ring
5. Altmetric Badge
   Chapter 4 Decision Problems and Complexity over a Ring
6. Altmetric Badge
   Chapter 5 The Class NP and NP-Complete Problems
7. Altmetric Badge
   Chapter 6 Integer Machines
8. Altmetric Badge
   Chapter 7 Algebraic Settings for the Problem “P ≠ NP?”
9. Altmetric Badge
   Chapter 8 Newton’s Method
10. Altmetric Badge
    Chapter 9 Fundamental Theorem of Algebra: Complexity Aspects
11. Altmetric Badge
    Chapter 10 Bézout’s Theorem
12. Altmetric Badge
    Chapter 11 Condition Numbers and the Loss of Precision of Linear Equations
13. Altmetric Badge
    Chapter 12 The Condition Number for Nonlinear Problems
14. Altmetric Badge
    Chapter 13 The Condition Number in ℙ( H ( d ) )
15. Altmetric Badge
    Chapter 14 Complexity and the Condition Number
16. Altmetric Badge
    Chapter 15 Linear Programming
17. Altmetric Badge
    Chapter 16 Deterministic Lower Bounds
18. Altmetric Badge
    Chapter 17 Probabilistic Machines
19. Altmetric Badge
    Chapter 18 Parallel Computations
20. Altmetric Badge
    Chapter 19 Some Separations of Complexity Classes
21. Altmetric Badge
    Chapter 20 Weak Machines
22. Altmetric Badge
    Chapter 21 Additive Machines
23. Altmetric Badge
    Chapter 22 Nonuniform Complexity Classes
24. Altmetric Badge
    Chapter 23 Descriptive Complexity