Pages that link to "Item:Q4344505"
From MaRDI portal
The following pages link to COMPLEXITY AND REAL COMPUTATION: A MANIFESTO (Q4344505):
Displaying 50 items.
- On the expected number of zeros of nonlinear equations (Q2441420) (← links)
- Tighter bounds of errors of numerical roots (Q2467047) (← links)
- There are significantly more nonnegative polynomials than sums of squares (Q2480563) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- A condition number theorem in convex programming (Q2515039) (← links)
- Counterexamples to the uniformity conjecture (Q2575586) (← links)
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries (Q2631966) (← links)
- On the expected number of real roots of polynomials and exponential sums (Q2693682) (← links)
- On the mathematical foundations of learning (Q2761194) (← links)
- On the number of real roots of random polynomials (Q2809262) (← links)
- Computing a nonnegative matrix factorization -- provably (Q2817794) (← links)
- The complexity of the nucleolus in compact games (Q2828226) (← links)
- 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 (Q2872513) (← links)
- The Legacy of Turing in Numerical Analysis (Q2891357) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- An Algebraic Proof of the Real Number PCP Theorem (Q2946376) (← links)
- Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
- Minimizing the discrete logarithmic energy on the sphere: The role of random polynomials (Q3004359) (← links)
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) (← links)
- Almost Transparent Short Proofs for NPℝ (Q3088268) (← links)
- The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs (Q3119536) (← links)
- Time-Bounded Verification of CTMCs against Real-Time Specifications (Q3172840) (← links)
- Verification of Hybrid Systems (Q3176388) (← links)
- CATEGORICAL COMPLEXITY (Q3304647) (← links)
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation (Q3384130) (← links)
- 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 (Q3433761) (← links)
- Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations (Q3520053) (← links)
- On Σ‐definability without equality over the real numbers (Q3528148) (← links)
- Two conjectures on the arithmetic in ℝ and ℂ (Q3552394) (← links)
- Computability of Analytic Functions with Analytic Machines (Q3576057) (← links)
- On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants (Q3576067) (← links)
- The probability that a slightly perturbed numerical analysis problem is difficult (Q3577011) (← links)
- Computability, noncomputability and undecidability of maximal intervals of IVPs (Q3629381) (← links)
- In Praise of Numerical Computation (Q3644734) (← links)
- Nonlinear Science — The Impact of Biology (Q4214825) (← links)
- Convergence of Newton’s method and inverse function theorem in Banach space (Q4221973) (← links)
- Computability of String Functions Over Algebraic Structures Armin Hemmerling (Q4379625) (← links)
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables (Q4517525) (← links)
- Interval Linear Algebra and Computational Complexity (Q4554518) (← links)
- Computation over algebraic structures and a classification of undecidable problems (Q4593236) (← links)
- The Condition Number of Join Decompositions (Q4604567) (← links)
- Generalizing Computability Theory to Abstract Algebras (Q4637219) (← links)
- An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound (Q4654024) (← links)
- Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
- Pseudozeros of multivariate polynomials (Q4794655) (← links)
- Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Q4922124) (← links)
- Multihomogeneous Newton methods (Q4955862) (← links)
- Newton's method for overdetermined systems of equations (Q4955863) (← links)
- On the cost of iterative computations (Q4993500) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
