Pages that link to "Item:Q4344505"
From MaRDI portal
The following pages link to COMPLEXITY AND REAL COMPUTATION: A MANIFESTO (Q4344505):
Displaying 50 items.
- Deformation techniques for sparse systems (Q1029552) (← links)
- Uncomputability and undecidability in economic theory (Q1036534) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- Mysteries of mathematics and computation (Q1323030) (← links)
- Uniform convergence of higher order quasi Hermite-Fejér interpolation (Q1334101) (← links)
- Elimination of constants from machines over algebraically closed fields (Q1361877) (← links)
- Local and global behavior for algorithms of solving equations (Q1428833) (← links)
- Counting problems over the reals (Q1575534) (← links)
- On the computational structure of the connected components of a hard problem (Q1607000) (← links)
- Kantorovich's theorem on Newton's method under majorant condition in Riemannian manifolds (Q1675560) (← links)
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739) (← links)
- On condition number theorems in mathematical programming (Q1695809) (← links)
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
- Energy of the Coulomb gas on the sphere at low temperature (Q1710993) (← links)
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric (Q1727976) (← links)
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions (Q1727980) (← links)
- Extending the Kantorovich's theorem on Newton's method for solving strongly regular generalized equation (Q1733339) (← links)
- Complexity classes and completeness in algebraic geometry (Q1740570) (← links)
- Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
- P\(\neq\) NC over the \(p\)-adic numbers (Q1869961) (← links)
- On the geometry and topology of the solution variety for polynomial system solving (Q1928275) (← links)
- Harmonic properties of the logarithmic potential and the computability of elliptic Fekete points (Q1939499) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
- Uncomputably large integral points on algebraic plane curves? (Q1978704) (← links)
- Extended Newton-type method for nonlinear functions with values in a cone (Q1993494) (← links)
- On measures of space over real and complex numbers (Q2019497) (← links)
- Computing spectral measures and spectral types (Q2025634) (← links)
- Correction to: ``Tropical varieties for exponential sums'' (Q2049974) (← links)
- Sensitivity of low-rank matrix recovery (Q2100520) (← links)
- A PCP of proximity for real algebraic polynomials (Q2117096) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems (Q2163445) (← links)
- On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem (Q2256583) (← links)
- A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- Random fields and the enumerative geometry of lines on real and complex hypersurfaces (Q2314808) (← links)
- Interactive proofs and a Shamir-like result for real number computations (Q2323360) (← links)
- A facility location formulation for stable polynomials and elliptic Fekete points (Q2340505) (← links)
- A complexity theory of constructible functions and sheaves (Q2340508) (← links)
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots (Q2341619) (← links)
- The PCP theorem for NP over the reals (Q2355329) (← links)
- \textit{The critic as artist}: Oscar Wilde's prolegomena to shape grammars (Q2361305) (← links)
- Two-square theorems for infinite matrices on certain fields (Q2367867) (← links)
- Online calibrated forecasts: memory efficiency versus universality for learning in games (Q2384142) (← links)
- Dual VP classes (Q2410687) (← links)
- A framework for real-valued cipher systems (Q2425831) (← links)
- Computing with multiple discrete flows (Q2430306) (← links)
- Mapcode characterization of partial recursive maps (Q2431022) (← links)
