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
Polyhedral Methods in Numerical Algebraic Geometry
TL;DR: This work proposes certificates for algebraic curves, which are the leading terms of a Puiseux series expansion of the curve starting at infinity, and relates the computation of tropisms to the calculation of mixed volumes.
Computation with Advice
Vasco Brattka,Arno Pauly +1 more
TL;DR: Computation with advice as discussed by the authors is a generalization of both computation with discrete advice and Type-2 Nondeterminism, and it has been shown that correct solutions are guessable with positive probability.
Posted Content
Optimal high-level descriptions of dynamical systems
TL;DR: The resulting State Space Compression (SSC) framework provides a guide for how to solve for the {optimal} high-level description of a given dynamical system, rather than constructing it based on human intuition alone.
Computational complexity of real valued recursive functions and analog circuits
TL;DR: It is shown that circuits with units that solve differential equations, simple units that add and multiply functions, and units that sense inequalities in a differentiable way, can compute sets of functions that range from the functions computable in linear space to the primitive recursive functions.
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.