Closure results for polynomial factorization

DOI10.4086/TOC.2019.V015A013MaRDI QIDQ5204831zbMATH OpenOpenAlexFDO

Authors Chi-Ning Chou, Mrinal Kumar, Noam Solomon

Publication date 5 December 2019

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2019.v015a013

zbMATH Keywords

algebraic complexitypolynomial factorization circuit lower boundspolynomial identity lemmapolynomial identity testing

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)

Recommendations

• Factors of low individual degree polynomials
• Factors of low individual degree polynomials
• Discovering the roots: uniform closure results for algebraic classes under factoring
• scientific article; zbMATH DE number 7250153
• Characterizing Valiant’s Algebraic Complexity Classes

Cited in

(16)

• Polynomial closure
• The complexity of factors of multivariate polynomials
• Factorization of polynomials given by arithmetic branching programs
• Factors of low individual degree polynomials
• scientific article; zbMATH DE number 1522548 (Why is no real title available?)
• Factors of low individual degree polynomials
• Derandomization from Algebraic Hardness
• Factorization of polynomials given by arithmetic branching programs
• Discovering the roots: uniform closure results for algebraic classes under factoring
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
• Complexity theory. Abstracts from the workshop held June 2--7, 2024
• On matrix multiplication and polynomial identity testing
• Superpolynomial lower bounds against low-depth algebraic circuits
• On efficient noncommutative polynomial factorization via Higman linearization
• Derandomization via symmetric polytopes: poly-time factorization of certain sparse polynomials
• Uniform bounds on product Sylvester-Gallai configurations

This page was built for publication: Closure results for polynomial factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204831)