Open AccessBook
Complexity and Real Computation
TLDR
This chapter discusses decision problems and Complexity over a Ring and the Fundamental Theorem of Algebra: Complexity Aspects.Abstract:
1 Introduction.- 2 Definitions and First Properties of Computation.- 3 Computation over a Ring.- 4 Decision Problems and Complexity over a Ring.- 5 The Class NP and NP-Complete Problems.- 6 Integer Machines.- 7 Algebraic Settings for the Problem "P ? NP?".- 8 Newton's Method.- 9 Fundamental Theorem of Algebra: Complexity Aspects.- 10 Bezout's Theorem.- 11 Condition Numbers and the Loss of Precision of Linear Equations.- 12 The Condition Number for Nonlinear Problems.- 13 The Condition Number in ?(H(d).- 14 Complexity and the Condition Number.- 15 Linear Programming.- 16 Deterministic Lower Bounds.- 17 Probabilistic Machines.- 18 Parallel Computations.- 19 Some Separations of Complexity Classes.- 20 Weak Machines.- 21 Additive Machines.- 22 Nonuniform Complexity Classes.- 23 Descriptive Complexity.- References.read more
Citations
More filters
Posted Content
On the topological aspects of the theory of represented spaces
TL;DR: The theory of represented spaces is well-known to exhibit a strong topological flavour as discussed by the authors, and it is a general setting for the study of computability derived from Turing machines, as such they are the basic entities for endeavors such as computable analysis or computable measure theory.
Book
Computability of Julia Sets
Mark Braverman,Michael Yampolsky +1 more
TL;DR: The computational hardness of Julia sets is discussed in this paper, which summarizes the present knowledge (most of it from the authors' own work) about the computational properties of Julia Sets in a self-contained way.
MonographDOI
A First Course on Numerical Methods
Uri M. Ascher,Chen Greif +1 more
TL;DR: This new book provides an in-depth treatment of fundamental issues and methods, the reasons behind the success and failure of numerical software, and fresh and easy-tofollow approaches and techniques.
Journal ArticleDOI
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One
TL;DR: This paper provides a criterion for locating clusters of zeros and a fast algorithm for approximating them, with quadratic convergence, in situations where the analytic map has corank one at the multiple isolated zero, which has embedding dimension one in the frame of deformation theory.
Journal ArticleDOI
Classical physics and the Church--Turing Thesis
TL;DR: In this article, it is observed that there is fundamental tension between the Extended Church--Turing Thesis and the existence of numerous seemingly intractable computational problems arising from classical physics.
References
More filters
Book
Principles of Algebraic Geometry
Phillip Griffiths,Joe Harris +1 more
TL;DR: In this paper, a comprehensive, self-contained treatment of complex manifold theory is presented, focusing on results applicable to projective varieties, and including discussion of the theory of Riemann surfaces and algebraic curves, algebraic surfaces and the quadric line complex.
Book
The algebraic eigenvalue problem
TL;DR: Theoretical background Perturbation theory Error analysis Solution of linear algebraic equations Hermitian matrices Reduction of a general matrix to condensed form Eigenvalues of matrices of condensed forms The LR and QR algorithms Iterative methods Bibliography.
Proceedings ArticleDOI
The complexity of theorem-proving procedures
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.