Correction to: ``The complexity of factors of multivariate polynomials

DOI10.1007/S10208-020-09477-6zbMATH Open1470.68046OpenAlexW3092560380MaRDI QIDQ827013FDOQ827013

Authors: Peter Bürgisser 

Publication date: 6 January 2021

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10208-020-09477-6

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Polynomials, factorization in commutative rings (13P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the order of approximation in approximative triadic decompositions of tensors

Cited In (2)

• Open problems in deformations of Artinian algebras, Hilbert schemes and around
• Title not available (Why is that?)

This page was built for publication: Correction to: ``The complexity of factors of multivariate polynomials

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