IPS Lower Bounds for Formulas and Sum of ROABPs
Fuente:
arXiv
Saved in:
| Main Authors: | Chatterjee, Prerona, Ghosal, Utsab, Mukhopadhyay, Partha, Sinhababu, Amit |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Lower Bounds from Succinct Hitting Sets
by: Chatterjee, Prerona, et al.
Published: (2023)
by: Chatterjee, Prerona, et al.
Published: (2023)
Lower Bounds for Set-Multilinear Branching Programs
by: Chatterjee, Prerona, et al.
Published: (2023)
by: Chatterjee, Prerona, et al.
Published: (2023)
Maximum Matching and Related Problems in Catalytic Logspace
by: Chakraborty, Srijan, et al.
Published: (2026)
by: Chakraborty, Srijan, et al.
Published: (2026)
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
by: Arvind, V., et al.
Published: (2023)
by: Arvind, V., et al.
Published: (2023)
The Complexity of Order-Finding for ROABPs
by: Bhargava, Vishwas, et al.
Published: (2024)
by: Bhargava, Vishwas, et al.
Published: (2024)
Derandomizing Multivariate Polynomial Factoring for Low Degree Factors
by: Dutta, Pranjal, et al.
Published: (2024)
by: Dutta, Pranjal, et al.
Published: (2024)
On the Hardness of Order Finding and Equivalence Testing for ROABPs
by: Ramya, C., et al.
Published: (2025)
by: Ramya, C., et al.
Published: (2025)
Lower Bounds for Subset Sum in Resolution with Modular Counting
by: Part, Fedor
Published: (2022)
by: Part, Fedor
Published: (2022)
Spectral Certificates and Sum-of-Squares Lower Bounds for Semirandom Hamiltonians
by: Kocurek, Nicholas
Published: (2025)
by: Kocurek, Nicholas
Published: (2025)
Trading Determinism for Noncommutativity in Edmonds' Problem
by: Arvind, V., et al.
Published: (2024)
by: Arvind, V., et al.
Published: (2024)
On the Existence of Algebraic Natural Proofs
by: Chatterjee, Prerona, et al.
Published: (2020)
by: Chatterjee, Prerona, et al.
Published: (2020)
Multiquadratic Sum-of-Squares Lower Bounds Imply VNC$^1$ $\neq$ VNP
by: Rossman, Benjamin, et al.
Published: (2025)
by: Rossman, Benjamin, et al.
Published: (2025)
Efficient Polynomial Identity Testing Over Nonassociative Algebras
by: Mukhopadhyay, Partha, et al.
Published: (2025)
by: Mukhopadhyay, Partha, et al.
Published: (2025)
Explicit Commutative ROABPs from Partial Derivatives
by: Bhargava, Vishwas, et al.
Published: (2024)
by: Bhargava, Vishwas, et al.
Published: (2024)
Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy
by: Assadi, Sepehr, et al.
Published: (2024)
by: Assadi, Sepehr, et al.
Published: (2024)
Local Enumeration and Majority Lower Bounds
by: Gurumukhani, Mohit, et al.
Published: (2024)
by: Gurumukhani, Mohit, et al.
Published: (2024)
Lower Bounds for Approximate Sign Rank
by: Bindua, Riju, et al.
Published: (2026)
by: Bindua, Riju, et al.
Published: (2026)
Spectral Lower Bounds for Local Search
by: Brânzei, Simina, et al.
Published: (2024)
by: Brânzei, Simina, et al.
Published: (2024)
Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials
by: Komarath, Balagopal, et al.
Published: (2025)
by: Komarath, Balagopal, et al.
Published: (2025)
Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs
by: Kothari, Pravesh K., et al.
Published: (2024)
by: Kothari, Pravesh K., et al.
Published: (2024)
Negations are powerful even in small depth
by: Cavalar, Bruno, et al.
Published: (2025)
by: Cavalar, Bruno, et al.
Published: (2025)
A Quadratic Lower Bound for Noncommutative Circuits
by: Shastri, Pratik
Published: (2026)
by: Shastri, Pratik
Published: (2026)
Lower Bounds for Bit Pigeonhole Principles in Bounded-Depth Resolution over Parities
by: Byramji, Farzan, et al.
Published: (2025)
by: Byramji, Farzan, et al.
Published: (2025)
Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies
by: Gajulapalli, Karthik, et al.
Published: (2025)
by: Gajulapalli, Karthik, et al.
Published: (2025)
Convergent Gate Elimination and Constructive Circuit Lower Bounds
by: Carmosino, Marco, et al.
Published: (2026)
by: Carmosino, Marco, et al.
Published: (2026)
Top-Down Lower Bounds for Depth-Four Circuits
by: Göös, Mika, et al.
Published: (2023)
by: Göös, Mika, et al.
Published: (2023)
Tight Lower Bounds for Block-Structured Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2024)
by: Hunkenschröder, Christoph, et al.
Published: (2024)
Lower Bounds for Conjunctive Query Evaluation
by: Mengel, Stefan
Published: (2025)
by: Mengel, Stefan
Published: (2025)
Bounded-Depth Frege Lower Bounds for Random 3-CNFs via Deterministic Restrictions
by: Gryaznov, Svyatoslav, et al.
Published: (2024)
by: Gryaznov, Svyatoslav, et al.
Published: (2024)
Algorithmic Structure in Subset Sum: Deterministic In-Bound Navigation and the Counting Complexity Divide
by: Nkosi, Thami
Published: (2025)
by: Nkosi, Thami
Published: (2025)
A Lower Bound on Conservative Elementary Object Systems Coverability
by: Di Cosmo, Francesco, et al.
Published: (2025)
by: Di Cosmo, Francesco, et al.
Published: (2025)
Lower Bounds against the Ideal Proof System in Finite Fields
by: Elbaz, Tal, et al.
Published: (2025)
by: Elbaz, Tal, et al.
Published: (2025)
Upper and Lower Bounds on $T_1$ and $T_2$ Decision Tree Model
by: Alhamdan, Yousef M.
Published: (2025)
by: Alhamdan, Yousef M.
Published: (2025)
Optimal Monotone Depth-Three Circuit Lower Bounds for Majority
by: Gurumukhani, Mohit, et al.
Published: (2026)
by: Gurumukhani, Mohit, et al.
Published: (2026)
Query Lower Bounds for Correlation Clustering under Memory Constraints
by: Garg, Sumegha, et al.
Published: (2026)
by: Garg, Sumegha, et al.
Published: (2026)
Separations above TFNP from Sherali-Adams Lower Bounds
by: Fleming, Noah, et al.
Published: (2026)
by: Fleming, Noah, et al.
Published: (2026)
Shrinkage under Random Projections, and Cubic Formula Lower Bounds for $\mathsf{AC}^0$
by: Filmus, Yuval, et al.
Published: (2020)
by: Filmus, Yuval, et al.
Published: (2020)
Improved Space Bounds for Subset Sum
by: Belova, Tatiana, et al.
Published: (2024)
by: Belova, Tatiana, et al.
Published: (2024)
Low Rank Matrix Rigidity: Tight Lower Bounds and Hardness Amplification
by: Alman, Josh, et al.
Published: (2025)
by: Alman, Josh, et al.
Published: (2025)
Polynomial Lower Bounds for Arithmetic Circuits over Non-Commutative Rings
by: Raz, Ran
Published: (2026)
by: Raz, Ran
Published: (2026)
Similar Items
-
Lower Bounds from Succinct Hitting Sets
by: Chatterjee, Prerona, et al.
Published: (2023) -
Lower Bounds for Set-Multilinear Branching Programs
by: Chatterjee, Prerona, et al.
Published: (2023) -
Maximum Matching and Related Problems in Catalytic Logspace
by: Chakraborty, Srijan, et al.
Published: (2026) -
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
by: Arvind, V., et al.
Published: (2023) -
The Complexity of Order-Finding for ROABPs
by: Bhargava, Vishwas, et al.
Published: (2024)