Factorization of polynomials given by arithmetic branching programs
From MaRDI portal
Publication:2051373
DOI10.1007/s00037-021-00215-0OpenAlexW3207259719WikidataQ114231717 ScholiaQ114231717MaRDI QIDQ2051373
Amit Sinhababu, Thomas Thierauf
Publication date: 24 November 2021
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-021-00215-0
Newton iterationHensel liftingarithmetic branching programhardness vs randomnessmultivariate polynomial factorization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factors of low individual degree polynomials
- On computing the determinant in small parallel time using a small number of processors
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Three new algorithms for multivariate polynomial GCD
- Completeness and reduction in algebraic complexity theory
- The complexity of factors of multivariate polynomials
- Effective Noether irreducibility forms and applications
- Equivalence of polynomial identity testing and polynomial factorization
- On Hensel factorization. I
- Algebraic Complexity Classes
- Modern Computer Algebra
- Quick and Dirty Refereeing?
- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
- Hensel and Newton Methods in Valuation Rings
- Fast Parallel Matrix Inversion Algorithms
- Determinant: Old Algorithms, New Insights
- Discovering the roots: uniform closure results for algebraic classes under factoring
- Expressing a fraction of two determinants as a determinant
- Proof Complexity Lower Bounds from Algebraic Circuit Complexity
- Derandomizing polynomial identity tests means proving circuit lower bounds
This page was built for publication: Factorization of polynomials given by arithmetic branching programs
