Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond
From MaRDI portal
Publication:3105516
zbMath1239.14051arXiv1101.2642MaRDI QIDQ3105516
J. Maurice Rojas, Osbert Bastani, Dimitar Popov, Christopher J. Hillar
Publication date: 5 January 2012
Full work available at URL: https://arxiv.org/abs/1101.2642
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Faster \(p\)-adic feasibility for certain multivariate sparse polynomials ⋮ Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces ⋮ Root separation for trinomials ⋮ Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields
This page was built for publication: Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond