COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A subdivision method for computing nearest gcd with certification
- Computability of String Functions Over Algebraic Structures Armin Hemmerling
- Distribution of the eigenvalues of a random system of homogeneous polynomials
- Interactive proofs and a Shamir-like result for real number computations
- Recent advances in real complexity and computation. UIMP-RSME Lluís Santaló summer school, Universidad Internacional Menéndez Pelayo, Santander, Spain, July 16--20, 2012
- A complexity theory of constructible functions and sheaves
- A condition number theorem in convex programming
- Smale's fundamental theorem of algebra reconsidered
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
- A dichotomy for real weighted Holant problems
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)
- In Praise of Numerical Computation
- On the geometry of random lemniscates
- On condition number theorems in mathematical programming
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision
- On the computational structure of the connected components of a hard problem
- A continuation method to solve polynomial systems and its complexity
- Almost transparent short proofs for \(\mathrm{NP}_{\mathbb R}\)
- Extending the Kantorovich's theorem on Newton's method for solving strongly regular generalized equation
- The Legacy of Turing in Numerical Analysis
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- Parametrised second-order complexity theory with applications to the study of interval computation
- Second-level algorithms, superrecursivity, and recovery problem in distributed systems
- Computing Semigroups with Error Control
- Abstract geometrical computation. III: Black holes for classical and analog computing
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
- Interval Linear Algebra and Computational Complexity
- The Expected Number of Eigenvalues of a Real Gaussian Tensor
- On the number of real roots of random polynomials
- Online calibrated forecasts: memory efficiency versus universality for learning in games
- Computation over algebraic structures and a classification of undecidable problems
- On Ladner's result for a class of real machines with restricted use of constants
- A PCP of proximity for real algebraic polynomials
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- On Ladner's result for a class of real machines with restricted use of constants
- Two-step Newton's method for deflation-one singular zeros of analytic systems
- Algorithms yield upper bounds in differential algebra
- Pseudozeros of multivariate polynomials
- Sensitivity of low-rank matrix recovery
- Extended Newton-type method for nonlinear functions with values in a cone
- A Survey on Analog Models of Computation
- Turing machines can be efficiently simulated by the general purpose analog computer
- Numerical elimination and moduli space of vacua
- Multihomogeneous Newton methods
- Newton's method for overdetermined systems of equations
- Deformation techniques for sparse systems
- The PCP theorem for NP over the reals
- Uncomputability and undecidability in economic theory
- A short survey on Kantorovich-like theorems for Newton's method
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- Two conjectures on the arithmetic in \(\mathbb R\) and \(\mathbb C\)
- Random points on an algebraic manifold
- Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions
- The complexity of the nucleolus in compact games
- On a problem posed by Steve Smale
- On measures of space over real and complex numbers
- Self-convexity and curvature
- Grid methods in computational real algebraic (and semialgebraic) geometry
- Exotic quantifiers, complexity classes, and complete problems
- Feferman on computability
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
- Elimination of constants from machines over algebraically closed fields
- Tighter bounds of errors of numerical roots
- Computing spectral measures and spectral types
- The condition number of join decompositions
- On multivariate quantiles under partial orders
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries
- Factoring multivariate polynomials via partial differential equations
- On the mathematical foundations of learning
- An Algebraic Proof of the Real Number PCP Theorem
- On the solution of systems of equations with constant rank derivatives
- Probabilistic analysis of condition numbers for linear programming
- On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem
- A complex analogue of Toda's theorem
- Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
- Small space analogues of Valiant's classes and the limitations of skew formulas
- Generalizing Computability Theory to Abstract Algebras
- Real computational universality: the word problem for a class of groups with infinite presentation
- \(P\) versus \(NP\) and geometry
- Holant problems for 3-regular graphs with complex edge functions
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Two-square theorems for infinite matrices on certain fields
- The probability that a slightly perturbed numerical analysis problem is difficult
- A hierarchy below the halting problem for additive machines
- On the central path of semidefinite optimization: degree and worst-case convergence rate
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- A geometric algorithm for winding number computation with complexity analysis
- Efficient simplicial replacement of semialgebraic sets
- Nonlinear Science — The Impact of Biology
- A short proof for the parameter continuation theorem
- A note on the finite variance of the averaging function for polynomial system solving
- Hausdorff approximations and volume of tubes of singular algebraic sets
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case
- Logical characterizations of algebraic circuit classes over integral domains
- Counterexamples to the uniformity conjecture
- Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set
This page was built for publication: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344505)
