Intrinsic complexity estimates in polynomial optimization (Q2251913): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: RAGlib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033158463 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.5214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polar varieties and efficient real elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polar varieties: geometry and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry of polar varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial and algebraic complexity of quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of a rational point of a variety over a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC algorithms for real algebraic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise proof of the Kronecker polynomial system solver from scratch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for diophantine approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-line programs in geometric elimination theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gröbner free alternative for polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding reachability of the infimum of a multivariate polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial inequalities in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving polynomial optimization problems via the truncated tangency variety and sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability and fast quantifier elimination in algebraically closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time-space complexity of geometric elimination procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The red book of varieties and schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact Jacobian SDP relaxation for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of computation on real algebraic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on results on Bezout's theorem. Notes by D. P. Patil / rank
 
Normal rank

Revision as of 17:52, 8 July 2024

scientific article
Language Label Description Also known as
English
Intrinsic complexity estimates in polynomial optimization
scientific article

    Statements

    Intrinsic complexity estimates in polynomial optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 July 2014
    0 references
    polynomial optimization
    0 references
    intrinsic complexity
    0 references
    degree of varieties
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references