Image de couverture de livre

On Factorization of Sparse Polynomials of Bounded Individual Degree

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chuyoon, Aminadav, Shpilka, Amir
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A New Bound on Cofactors of Sparse Polynomials
par: Nahshon, Ido, et autres
Publié: (2023)

Polynomial Identity Testing and Reconstruction for Depth-4 Powering Circuits of High Degree
par: Shpilka, Amir, et autres
Publié: (2026)

Improved Debordering of Waring Rank
par: Shpilka, Amir
Publié: (2025)

Lower Bounds for Set-Multilinear Branching Programs
par: Chatterjee, Prerona, et autres
Publié: (2023)

On the Complexity of Hazard-Free Formulas
par: Arazi, Leah London, et autres
Publié: (2024)

Derandomizing Multivariate Polynomial Factoring for Low Degree Factors
par: Dutta, Pranjal, et autres
Publié: (2024)

Low-Degree Polynomials Are Good Extractors
par: Alrabiah, Omar, et autres
Publié: (2024)

On the Dynamics of Bounded-Degree Automata Networks
par: Aracena, Julio, et autres
Publié: (2025)

Complexity of Multiple-Hamiltonicity in Graphs of Bounded Degree
par: Liu, Brian, et autres
Publié: (2024)

A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions
par: Yao, Penghui, et autres
Publié: (2025)

Feedback Set Problems on Bounded-Degree (Planar) Graphs
par: Bai, Tian, et autres
Publié: (2026)

Property Testing in Bounded Degree Hypergraphs
par: Aaronson, Hugo, et autres
Publié: (2025)

The Quasi-Polynomial Low-Degree Conjecture is False
par: Buhai, Rares-Darius, et autres
Publié: (2025)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
par: Dwivedi, Ashish, et autres
Publié: (2024)

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials
par: Komarath, Balagopal, et autres
Publié: (2025)

A Simple Sub-Polynomial Degree Coboundary Expander
par: Hopkins, Max, et autres
Publié: (2026)

Polynomial Lower Bounds for Arithmetic Circuits over Non-Commutative Rings
par: Raz, Ran
Publié: (2026)

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
par: Shao, Shuai, et autres
Publié: (2023)

Almost Polynomial Factor Inapproximability for Parameterized k-Clique
par: S., Karthik C., et autres
Publié: (2021)

On Efficient Noncommutative Polynomial Factorization via Higman Linearization
par: Arvind, V., et autres
Publié: (2022)

Simple Norm Bounds for Polynomial Random Matrices via Decoupling
par: Tulsiani, Madhur, et autres
Publié: (2024)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials
par: Bhargav, C. S., et autres
Publié: (2025)

Discreteness of asymptotic tensor ranks
par: Briët, Jop, et autres
Publié: (2023)

Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
par: Gibor, Daniel
Publié: (2025)

Structural Parameterizations for Two Bounded Degree Problems Revisited
par: Lampis, Michael, et autres
Publié: (2023)

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials
par: Wein, Alexander S.
Publié: (2025)

Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
par: Dikstein, Yotam, et autres
Publié: (2024)

Sharp Phase Transitions in Estimation with Low-Degree Polynomials
par: Sohn, Youngtak, et autres
Publié: (2025)

A New Reduction Method from Multivariate Polynomials to Univariate Polynomials
par: Wang, Cancan, et autres
Publié: (2024)

Approximate Degree Composition for Recursive Functions
par: Chakraborty, Sourav, et autres
Publié: (2024)

Low-Degree Testing Over Grids
par: Amireddy, Prashanth, et autres
Publié: (2023)

Quantum Property Testing for Bounded-Degree Directed Graphs
par: Peng, Pan, et autres
Publié: (2026)

Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy
par: Assadi, Sepehr, et autres
Publié: (2024)

Hilbert Functions and Low-Degree Randomness Extractors
par: Golovnev, Alexander, et autres
Publié: (2024)

Low Degree Local Correction Over the Boolean Cube
par: Amireddy, Prashanth, et autres
Publié: (2024)

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
par: Khanna, Sanjeev, et autres
Publié: (2025)

On Sampling Lower Bounds for Polynomials
par: Khodabandeh, Mohammad Mahdi, et autres
Publié: (2026)

Lifting with Inner Functions of Polynomial Discrepancy
par: Manor, Yahel, et autres
Publié: (2024)

Symmetric Algebraic Circuits and Homomorphism Polynomials
par: Dawar, Anuj, et autres
Publié: (2025)

On Matrix Multiplication and Polynomial Identity Testing
par: Andrews, Robert
Publié: (2022)