Pages that link to "Item:Q5300525"
From MaRDI portal
The following pages link to On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications (Q5300525):
Displaying 11 items.
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
- Divide and conquer roadmap for algebraic sets (Q464736) (← links)
- Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Exponential convexifying of polynomials (Q2088659) (← links)
- The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
- Computing real witness points of positive dimensional polynomial systems (Q2357373) (← links)
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5918421) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)
- RAC-Drawability is ∃ℝ-complete and Related Results (Q6181953) (← links)
