Factorization of polynomials given by arithmetic branching programs
type: Item
instance of: scholarly article
title: Factorization of polynomials given by arithmetic branching programs
author: Amit Sinhababu
author: Thomas Thierauf
published in: Computational Complexity
publication date: 2021-11-24T00:00:00Z
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 7432865
zbMATH Keywords: arithmetic branching program
zbMATH Keywords: multivariate polynomial factorization
zbMATH Keywords: Hensel lifting
zbMATH Keywords: Newton iteration
zbMATH Keywords: hardness vs randomness
describes a project that uses: lowerbounds-survey
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s00037-021-00215-0
OpenAlex ID: W3207259719
Wikidata QID: Q114231717
cites work: On computing the determinant in small parallel time using a small number of processors
cites work: The complexity of factors of multivariate polynomials
cites work: Completeness and reduction in algebraic complexity theory
cites work: Q3719722
cites work: Q5204831
cites work: Fast Parallel Matrix Inversion Algorithms
cites work: Discovering the roots: uniform closure results for algebraic classes under factoring
cites work: Proof Complexity Lower Bounds from Algebraic Circuit Complexity
cites work: Hensel and Newton Methods in Valuation Rings
cites work: Modern computer algebra
cites work: Q4023676
cites work: Derandomizing polynomial identity tests means proving circuit lower bounds
cites work: Effective Noether irreducibility forms and applications
cites work: Expressing a fraction of two determinants as a determinant
cites work: Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
cites work: Equivalence of polynomial identity testing and polynomial factorization
cites work: Q5207889
cites work: Algebraic Complexity Classes
cites work: Determinant: Old Algorithms, New Insights
cites work: Factors of low individual degree polynomials
cites work: Q4967171
cites work: Three new algorithms for multivariate polynomial GCD
cites work: On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
cites work: Quick and Dirty Refereeing?
cites work: On Hensel factorization. I
DOI: 10.1007/S00037-021-00215-0
description: scientific article; zbMATH DE number 7432865