Saved in:
| Main Authors: | Liu, Junfeng, Zhao, Qinghua, Ni, Liwei, Wang, Jingren, Xie, Biwei, Li, Xingquan, Yu, Bei, Ma, Shuai |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.12554 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Parallel AIG Refactoring via Conflict Breaking
by: Cai, Ye, et al.
Published: (2024)
by: Cai, Ye, et al.
Published: (2024)
Enhancing ASIC Technology Mapping via Parallel Supergate Computing
by: Cai, Ye, et al.
Published: (2024)
by: Cai, Ye, et al.
Published: (2024)
Epistemic Skills: Logical Dynamics of Knowing and Forgetting
by: Liang, Xiaolong, et al.
Published: (2024)
by: Liang, Xiaolong, et al.
Published: (2024)
On the Dynamics of Bounded-Degree Automata Networks
by: Aracena, Julio, et al.
Published: (2025)
by: Aracena, Julio, et al.
Published: (2025)
Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETH
by: Li, Shuangle, et al.
Published: (2024)
by: Li, Shuangle, et al.
Published: (2024)
The Complexity and Expressive Power of Second-Order Extended Logic
by: Feng, Shiguang, et al.
Published: (2022)
by: Feng, Shiguang, et al.
Published: (2022)
Complexity of Multiple-Hamiltonicity in Graphs of Bounded Degree
by: Liu, Brian, et al.
Published: (2024)
by: Liu, Brian, et al.
Published: (2024)
Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies
by: Gajulapalli, Karthik, et al.
Published: (2025)
by: Gajulapalli, Karthik, 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)
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 Bit Pigeonhole Principles in Bounded-Depth Resolution over Parities
by: Byramji, Farzan, et al.
Published: (2025)
by: Byramji, Farzan, et al.
Published: (2025)
Upper Bounds for Symmetric Approximate Bounded Indistinguishability
by: Williamson, Christopher
Published: (2026)
by: Williamson, Christopher
Published: (2026)
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)
A Courcelle-Type Metatheorem for Rank-Bounded Unconstrained Binary Optimization
by: Harary, Marc
Published: (2025)
by: Harary, Marc
Published: (2025)
Logical Expressibility of Syntactic NL for Complementarity, Monotonicity, and Maximization
by: Yamakami, Tomoyuki
Published: (2024)
by: Yamakami, Tomoyuki
Published: (2024)
Reasonable Bounds for Combinatorial Lines of Length Three
by: Bhangale, Amey, et al.
Published: (2024)
by: Bhangale, Amey, et al.
Published: (2024)
Bounds for Hardness Condensation in the Query Model
by: Kayal, Chandrima, et al.
Published: (2026)
by: Kayal, Chandrima, et al.
Published: (2026)
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)
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
by: Blocki, Jeremiah, et al.
Published: (2021)
by: Blocki, Jeremiah, et al.
Published: (2021)
Aspects of Coherence in Dependence Logic
by: Barlag, Timon, et al.
Published: (2026)
by: Barlag, Timon, et al.
Published: (2026)
A Quadratic Lower Bound for Noncommutative Circuits
by: Shastri, Pratik
Published: (2026)
by: Shastri, Pratik
Published: (2026)
Improved Bounds on the Space Complexity of Circuit Evaluation
by: Shalunov, Yakov
Published: (2025)
by: Shalunov, Yakov
Published: (2025)
IPS Lower Bounds for Formulas and Sum of ROABPs
by: Chatterjee, Prerona, et al.
Published: (2025)
by: Chatterjee, Prerona, et al.
Published: (2025)
The Complexity of Logarithmic Space Bounded Counting Classes
by: Vijayaraghavan, T. C.
Published: (2025)
by: Vijayaraghavan, T. C.
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 Factorization of Sparse Polynomials of Bounded Individual Degree
by: Chuyoon, Aminadav, et al.
Published: (2026)
by: Chuyoon, Aminadav, et al.
Published: (2026)
Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
by: Block, Alexander R., et al.
Published: (2026)
by: Block, Alexander R., et al.
Published: (2026)
Finding Bugs in Short Proofs: The Metamathematics of Resolution Lower Bounds
by: Li, Jiawei, et al.
Published: (2024)
by: Li, Jiawei, et al.
Published: (2024)
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)
New Pseudorandom Generators and Correlation Bounds Using Extractors
by: Kumar, Vinayak M.
Published: (2025)
by: Kumar, Vinayak M.
Published: (2025)
Feedback Set Problems on Bounded-Degree (Planar) Graphs
by: Bai, Tian, et al.
Published: (2026)
by: Bai, Tian, et al.
Published: (2026)
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)
Logic and Computation through the Lens of Semirings
by: Barlag, Timon, et al.
Published: (2025)
by: Barlag, Timon, et al.
Published: (2025)
Feasibility of Primality in Bounded Arithmetic
by: Jalali, Raheleh, et al.
Published: (2025)
by: Jalali, Raheleh, et al.
Published: (2025)
Unifying the Landscape of Super-Logarithmic Dynamic Cell-Probe Lower Bounds
by: Ko, Young Kun
Published: (2025)
by: Ko, Young Kun
Published: (2025)
Similar Items
-
Parallel AIG Refactoring via Conflict Breaking
by: Cai, Ye, et al.
Published: (2024) -
Enhancing ASIC Technology Mapping via Parallel Supergate Computing
by: Cai, Ye, et al.
Published: (2024) -
Epistemic Skills: Logical Dynamics of Knowing and Forgetting
by: Liang, Xiaolong, et al.
Published: (2024) -
On the Dynamics of Bounded-Degree Automata Networks
by: Aracena, Julio, et al.
Published: (2025) -
Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETH
by: Li, Shuangle, et al.
Published: (2024)