Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.19604 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912447127879680 |
|---|---|
| author | Bhargav, C. S. Dwivedi, Prateek Saxena, Nitin |
| author_facet | Bhargav, C. S. Dwivedi, Prateek Saxena, Nitin |
| contents | Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity theory classifies polynomials into complexity classes based on their perceived `hardness'. This raises a natural question: Do these classes afford efficient factorization?
In this survey, we revisit two pivotal techniques in polynomial factorization: Hensel lifting and Newton iteration. Though they are variants of the same theme, their distinct applications across the literature warrant separate treatment. These techniques have played an important role in resolving key factoring questions in algebraic complexity theory. We examine and organise the known results through the lens of these techniques to highlight their impact. We also discuss their equivalence while reflecting on how their use varies with the context of the problem.
We focus on four prominent complexity classes: circuits of polynomial size ($\text{VP}_{\text{nb}}$), circuits with both polynomial size and degree (VP and its border $\overline{\text{VP}}$), verifier circuits of polynomial size and degree (VNP), and polynomial-size algebraic branching programs (VBP). We also examine more restricted models, such as formulas and bounded-depth circuits. Along the way, we list several open problems that remain unresolved. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_19604 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A primer on the closure of algebraic complexity classes under factoring Bhargav, C. S. Dwivedi, Prateek Saxena, Nitin Computational Complexity Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity theory classifies polynomials into complexity classes based on their perceived `hardness'. This raises a natural question: Do these classes afford efficient factorization? In this survey, we revisit two pivotal techniques in polynomial factorization: Hensel lifting and Newton iteration. Though they are variants of the same theme, their distinct applications across the literature warrant separate treatment. These techniques have played an important role in resolving key factoring questions in algebraic complexity theory. We examine and organise the known results through the lens of these techniques to highlight their impact. We also discuss their equivalence while reflecting on how their use varies with the context of the problem. We focus on four prominent complexity classes: circuits of polynomial size ($\text{VP}_{\text{nb}}$), circuits with both polynomial size and degree (VP and its border $\overline{\text{VP}}$), verifier circuits of polynomial size and degree (VNP), and polynomial-size algebraic branching programs (VBP). We also examine more restricted models, such as formulas and bounded-depth circuits. Along the way, we list several open problems that remain unresolved. |
| title | A primer on the closure of algebraic complexity classes under factoring |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2506.19604 |