Faster real feasibility via circuit discriminants

DOI10.1145/1576702.1576711zbMath1237.68251arXiv0901.4400OpenAlexW2080881761MaRDI QIDQ2883798

Casey E. Stella, J. Maurice Rojas, Frédéric Bihan

Publication date: 13 May 2012

Published in: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.4400

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Related Items (7)

Coamoebas of Polynomials Supported on Circuits ⋮ Amoebas of genus at most one ⋮ Faster \(p\)-adic feasibility for certain multivariate sparse polynomials ⋮ Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) ⋮ Computing the multilinear factors of lacunary polynomials without heights ⋮ Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces ⋮ Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields

This page was built for publication: Faster real feasibility via circuit discriminants