COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A hierarchy below the halting problem for additive machines
- From a zoo to a zoology: Towards a general theory of graph polynomials
- Exotic quantifiers, complexity classes, and complete problems
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Conditioning of random conic systems under a general family of input distributions
- Deformation techniques for sparse systems
- Uncomputability and undecidability in economic theory
- Computation by `While' programs on topological partial algebras
- Mysteries of mathematics and computation
- Uniform convergence of higher order quasi Hermite-Fejér interpolation
- Elimination of constants from machines over algebraically closed fields
- Local and global behavior for algorithms of solving equations
- Counting problems over the reals
- On the computational structure of the connected components of a hard problem
- Kantorovich's theorem on Newton's method under majorant condition in Riemannian manifolds
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- On condition number theorems in mathematical programming
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Energy of the Coulomb gas on the sphere at low temperature
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
- Extending the Kantorovich's theorem on Newton's method for solving strongly regular generalized equation
- Complexity classes and completeness in algebraic geometry
- Grid methods in computational real algebraic (and semialgebraic) geometry
- P\(\neq\) NC over the \(p\)-adic numbers
- On the geometry and topology of the solution variety for polynomial system solving
- Harmonic properties of the logarithmic potential and the computability of elliptic Fekete points
- Small space analogues of Valiant's classes and the limitations of skew formulas
- Robust certified numerical homotopy tracking
- Uncomputably large integral points on algebraic plane curves?
- Extended Newton-type method for nonlinear functions with values in a cone
- On measures of space over real and complex numbers
- Computing spectral measures and spectral types
- Correction to: ``Tropical varieties for exponential sums
- Sensitivity of low-rank matrix recovery
- A PCP of proximity for real algebraic polynomials
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem
- A note on the finite variance of the averaging function for polynomial system solving
- Parametrised second-order complexity theory with applications to the study of interval computation
- Random fields and the enumerative geometry of lines on real and complex hypersurfaces
- Interactive proofs and a Shamir-like result for real number computations
- A facility location formulation for stable polynomials and elliptic Fekete points
- A complexity theory of constructible functions and sheaves
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- The PCP theorem for NP over the reals
- \textit{The critic as artist}: Oscar Wilde's prolegomena to shape grammars
- Two-square theorems for infinite matrices on certain fields
- Online calibrated forecasts: memory efficiency versus universality for learning in games
- Dual VP classes
- A framework for real-valued cipher systems
- Computing with multiple discrete flows
- Mapcode characterization of partial recursive maps
- On the expected number of zeros of nonlinear equations
- Tighter bounds of errors of numerical roots
- There are significantly more nonnegative polynomials than sums of squares
- Improved complexity results on solving real-number linear feasibility problems
- A condition number theorem in convex programming
- Distribution of the eigenvalues of a random system of homogeneous polynomials
- Counterexamples to the uniformity conjecture
- A dichotomy for real weighted Holant problems
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries
- On the expected number of real roots of polynomials and exponential sums
- On the mathematical foundations of learning
- On the number of real roots of random polynomials
- Computing a nonnegative matrix factorization -- provably
- The complexity of the nucleolus in compact games
- 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
- The Legacy of Turing in Numerical Analysis
- Self-convexity and curvature
- Computability and dynamical systems
- An Algebraic Proof of the Real Number PCP Theorem
- Bad semidefinite programs: they all look the same
- Minimizing the discrete logarithmic energy on the sphere: the role of random polynomials
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- Almost transparent short proofs for \(\mathrm{NP}_{\mathbb R}\)
- The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
- 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
- Time-Bounded Verification of CTMCs against Real-Time Specifications
- Verification of Hybrid Systems
- A primal-dual formulation for certifiable computations in Schubert calculus
- Categorical complexity
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
- 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
- Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations
- On Σ‐definability without equality over the real numbers
- Two conjectures on the arithmetic in \(\mathbb R\) and \(\mathbb C\)
- Computability of analytic functions with analytic machines
- On Ladner's result for a class of real machines with restricted use of constants
- The probability that a slightly perturbed numerical analysis problem is difficult
- Querying probabilistic business processes for sub-flows
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- In Praise of Numerical Computation
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- Smale's fundamental theorem of algebra reconsidered
- Complexity of path-following methods for the eigenvalue problem
- On Ladner's result for a class of real machines with restricted use of constants
- Nonlinear Science — The Impact of Biology
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)
