scientific article
From MaRDI portal
Publication:2911618
DOI10.4230/LIPIcs.FSTTCS.2011.127zbMath1246.68123arXiv1107.1434MaRDI QIDQ2911618
Bruno Grenet, Yann Strozecki, Natacha Portier, Pascal Koiran
Publication date: 31 August 2012
Full work available at URL: https://arxiv.org/abs/1107.1434
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algebraic complexityDescartes' rule of signspolynomial identity testingsparse polynomialslower bound for the permanent
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Multi-\(k\)-ic depth three circuit lower bound ⋮ Testing the satisfiability of algebraic formulas over the field of two elements ⋮ A Wronskian approach to the real \(\tau\)-conjecture ⋮ Computing the multilinear factors of lacunary polynomials without heights ⋮ On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem ⋮ Intersection multiplicity of a sparse curve and a low-degree curve ⋮ Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits
This page was built for publication:
