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
A structural geometrical analysis of weakly infeasible SDPs
TL;DR: It is shown that for a weakly infeasible problem over $n\times n$ matrices, at most $n-1 directions are required to approach the positive semidefinite cone.
Journal ArticleDOI
Exact Computation of the Topology and Geometric Invariants of the Voronoi Diagram of Spheres in 3D
TL;DR: This paper presents a methodology for automated derivation of invariants of the Delaunay empty circumsphere predicate for spheres and the Voronoi vertex of four spheres, then the application of this methodology to get all geometrical invariants that intervene in this problem and the exact computation of theDelaunay graph and thevoronoi diagram of spheres using Wu’s algorithm.
Proceedings Article
∀∃ℝ-Completeness and Area-Universality.
TL;DR: In the study of geometric problems, the complexity class \(\exists \mathbb {R}\) plays a crucial role since it exhibits a deep connection between purely geometric problems and real algebra.
Journal ArticleDOI
Counting Irreducible Components of Complex Algebraic Varieties
TL;DR: An algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs, obtained from an explicit version of Bertini’s theorem is presented.
Habilitation à Diriger des Recherches
TL;DR: This memoir for accreditation to supervise research deals with continuous models of computation and defines a continuous model, signal machines, that generates geometrical figures complying strict rules that can be understood as a continuous extension of cellular automata.
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.