Convergent Gate Elimination and Constructive Circuit Lower Bounds
Fuente:
arXiv
Saved in:
| Main Authors: | Carmosino, Marco, Dang, Ngu, Jackman, Tim |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Constructive Separations from Gate Elimination
by: Carmosino, Marco, et al.
Published: (2026)
by: Carmosino, Marco, et al.
Published: (2026)
Simple Circuit Extensions for XOR in PTIME
by: Carmosino, Marco, et al.
Published: (2025)
by: Carmosino, Marco, et al.
Published: (2025)
A Quadratic Lower Bound for Noncommutative Circuits
by: Shastri, Pratik
Published: (2026)
by: Shastri, Pratik
Published: (2026)
Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing
by: Mao, Xinyu, et al.
Published: (2024)
by: Mao, Xinyu, et al.
Published: (2024)
Top-Down Lower Bounds for Depth-Four Circuits
by: Göös, Mika, et al.
Published: (2023)
by: Göös, Mika, et al.
Published: (2023)
Optimal Monotone Depth-Three Circuit Lower Bounds for Majority
by: Gurumukhani, Mohit, et al.
Published: (2026)
by: Gurumukhani, Mohit, et al.
Published: (2026)
Optimal Lower Bounds for Symmetric Modular Circuits
by: Pago, Benedikt
Published: (2026)
by: Pago, Benedikt
Published: (2026)
Polynomial Lower Bounds for Arithmetic Circuits over Non-Commutative Rings
by: Raz, Ran
Published: (2026)
by: Raz, Ran
Published: (2026)
Improved Circuit Lower Bounds and Quantum-Classical Separations
by: Grewal, Sabee, et al.
Published: (2024)
by: Grewal, Sabee, et al.
Published: (2024)
New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String
by: Chen, Lijie, et al.
Published: (2025)
by: Chen, Lijie, et al.
Published: (2025)
Lower bounds for planar Arithmetic Circuits
by: Ramya, C., et al.
Published: (2025)
by: Ramya, C., et al.
Published: (2025)
AC^0[p]-Frege Cannot Efficiently Prove that Constant-Depth Algebraic Circuit Lower Bounds are Hard
by: Lu, Jiaqi, et al.
Published: (2025)
by: Lu, Jiaqi, et al.
Published: (2025)
Lower Bounds for Approximate Sign Rank
by: Bindua, Riju, et al.
Published: (2026)
by: Bindua, Riju, et al.
Published: (2026)
Local Enumeration and Majority Lower Bounds
by: Gurumukhani, Mohit, et al.
Published: (2024)
by: Gurumukhani, Mohit, et al.
Published: (2024)
Spectral Lower Bounds for Local Search
by: Brânzei, Simina, et al.
Published: (2024)
by: Brânzei, Simina, et al.
Published: (2024)
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)
IPS Lower Bounds for Formulas and Sum of ROABPs
by: Chatterjee, Prerona, et al.
Published: (2025)
by: Chatterjee, Prerona, et al.
Published: (2025)
Lower Bounds for Set-Multilinear Branching Programs
by: Chatterjee, Prerona, et al.
Published: (2023)
by: Chatterjee, Prerona, et al.
Published: (2023)
Lower Bounds from Succinct Hitting Sets
by: Chatterjee, Prerona, et al.
Published: (2023)
by: Chatterjee, Prerona, et al.
Published: (2023)
On the Number of Quantifiers Needed to Define Boolean Functions
by: Carmosino, Marco, et al.
Published: (2024)
by: Carmosino, Marco, et al.
Published: (2024)
Multi-Structural Games and Beyond
by: Carmosino, Marco, et al.
Published: (2023)
by: Carmosino, Marco, et al.
Published: (2023)
A Simple Constructive Bound on Circuit Size Change Under Truth Table Perturbation
by: Krinkin, Kirill
Published: (2026)
by: Krinkin, Kirill
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)
Improved Bounds on the Space Complexity of Circuit Evaluation
by: Shalunov, Yakov
Published: (2025)
by: Shalunov, Yakov
Published: (2025)
Lower Bounds for Symmetric Circuits for the Determinant
by: Dawar, Anuj, et al.
Published: (2021)
by: Dawar, Anuj, et al.
Published: (2021)
Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies
by: Gajulapalli, Karthik, et al.
Published: (2025)
by: Gajulapalli, Karthik, et al.
Published: (2025)
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 Subset Sum in Resolution with Modular Counting
by: Part, Fedor
Published: (2022)
by: Part, Fedor
Published: (2022)
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)
Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
by: Gamarnik, David, et al.
Published: (2023)
by: Gamarnik, David, et al.
Published: (2023)
Symmetric Algebraic Circuits and Homomorphism Polynomials
by: Dawar, Anuj, et al.
Published: (2025)
by: Dawar, Anuj, et al.
Published: (2025)
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)
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)
Spectral Certificates and Sum-of-Squares Lower Bounds for Semirandom Hamiltonians
by: Kocurek, Nicholas
Published: (2025)
by: Kocurek, Nicholas
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)
Range Avoidance in Boolean Circuits via Turan-type Bounds
by: Kuntewar, Neha, et al.
Published: (2025)
by: Kuntewar, Neha, et al.
Published: (2025)
Parallel Play Saves Quantifiers
by: Carmosino, Marco, et al.
Published: (2024)
by: Carmosino, Marco, et al.
Published: (2024)
Similar Items
-
Constructive Separations from Gate Elimination
by: Carmosino, Marco, et al.
Published: (2026) -
Simple Circuit Extensions for XOR in PTIME
by: Carmosino, Marco, et al.
Published: (2025) -
A Quadratic Lower Bound for Noncommutative Circuits
by: Shastri, Pratik
Published: (2026) -
Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing
by: Mao, Xinyu, et al.
Published: (2024) -
Top-Down Lower Bounds for Depth-Four Circuits
by: Göös, Mika, et al.
Published: (2023)