A Wronskian approach to the real \(\tau\)-conjecture

DOI10.1016/j.jsc.2014.09.036zbMath1302.68331arXiv1205.1015OpenAlexW2073036037WikidataQ123309854 ScholiaQ123309854MaRDI QIDQ480686

Pascal Koiran, Sébastien Tavenas, Natacha Portier

Publication date: 9 December 2014

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

real algebraic geometryreal \(\tau\)-conjecturesparse polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Real algebraic and real-analytic geometry (14P99)

Related Items (9)

Lower Bounds for Sums of Powers of Low Degree Univariates ⋮ Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ Real zeros of mixed random fewnomial systems ⋮ Tropical combinatorial Nullstellensatz and sparse polynomials ⋮ Computing the multilinear factors of lacunary polynomials without heights ⋮ A sharp bound on the number of real intersection points of a sparse plane curve with a line ⋮ On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem ⋮ On the Number of Real Zeros of Random Fewnomials ⋮ Intersection multiplicity of a sparse curve and a low-degree curve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of roots of a lacunary bivariate polynomial on a line
• Counting real connected components of trinomial curve intersections and \(m\)-nomial hypersurfaces
• Completeness and reduction in algebraic complexity theory
• The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators
• Simple exponential estimate for the number of real zeros of complete abelian integrals
• On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?
• Progress on Polynomial Identity Testing - II
• Computational Complexity of Sparse Rational Interpolation
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Derandomizing polynomial identity tests means proving circuit lower bounds

This page was built for publication: A Wronskian approach to the real \(\tau\)-conjecture