Pages that link to "Item:Q4344505"
From MaRDI portal
The following pages link to COMPLEXITY AND REAL COMPUTATION: A MANIFESTO (Q4344505):
Displaying 50 items.
- Distribution of the eigenvalues of a random system of homogeneous polynomials (Q254895) (← links)
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- Self-convexity and curvature (Q290787) (← links)
- Holant problems for 3-regular graphs with complex edge functions (Q315538) (← links)
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant (Q315740) (← links)
- A primal-dual formulation for certifiable computations in Schubert calculus (Q330099) (← links)
- Querying probabilistic business processes for sub-flows (Q359875) (← links)
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← links)
- Smale's fundamental theorem of algebra reconsidered (Q404254) (← links)
- Complexity of path-following methods for the eigenvalue problem (Q404275) (← links)
- On Ladner's result for a class of real machines with restricted use of constants (Q418114) (← links)
- A geometric algorithm for winding number computation with complexity analysis (Q423881) (← links)
- A complex analogue of Toda's theorem (Q454132) (← links)
- Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
- Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
- On cones of nonnegative quartic forms (Q525602) (← links)
- The numerical factorization of polynomials (Q525605) (← links)
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
- On the solution of systems of equations with constant rank derivatives (Q542442) (← links)
- On multivariate quantiles under partial orders (Q548551) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- A continuation method to solve polynomial systems and its complexity (Q621308) (← links)
- Fast linear homotopy to find approximate zeros of polynomial systems (Q626447) (← links)
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- Effectiveness in RPL, with applications to continuous logic (Q636319) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions (Q639348) (← links)
- Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- Computing the homology of real projective sets (Q667646) (← links)
- Second-level algorithms, superrecursivity, and recovery problem in distributed systems (Q692890) (← links)
- Representation theorems for analytic machines and computability of analytic functions (Q693052) (← links)
- Probabilistic analysis of condition numbers for linear programming (Q700762) (← links)
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← links)
- Abstract geometrical computation. III: Black holes for classical and analog computing (Q734212) (← links)
- Numerical elimination and moduli space of vacua (Q737597) (← links)
- On the solution of the polynomial systems arising in the discretization of certain ODEs (Q836949) (← links)
- Geometry and topology of proper polynomial mappings (Q844398) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable (Q905698) (← links)
- The computational complexity of evolutionarily stable strategies (Q926196) (← links)
- The Turing degrees for some computation model with the real parameter (Q930625) (← links)
- Analysis of a type of nonsmooth dynamical systems (Q943311) (← links)
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
- A hierarchy below the halting problem for additive machines (Q1015375) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric (Q1022430) (← links)
- Conditioning of random conic systems under a general family of input distributions (Q1029212) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
