Saved in:
| Main Authors: | Mao, Xinyu, Yang, Guangxu, Zhang, Jiapeng |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.10996 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Deterministic Lifting Theorems for One-Way Number-on-Forehead Communication
by: Yang, Guangxu, et al.
Published: (2025)
by: Yang, Guangxu, et al.
Published: (2025)
Pointer Chasing with Unlimited Interaction
by: Fischer, Orr, et al.
Published: (2025)
by: Fischer, Orr, et al.
Published: (2025)
Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
by: Yang, Guangxu, et al.
Published: (2026)
by: Yang, Guangxu, et al.
Published: (2026)
Quantum versus Classical Separation in Simultaneous Number-on-Forehead Communication
by: Yang, Guangxu, et al.
Published: (2025)
by: Yang, Guangxu, et al.
Published: (2025)
A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
by: Wu, Xudong, et al.
Published: (2025)
by: Wu, Xudong, 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)
Quantum Lower Bounds by Sample-to-Query Lifting
by: Wang, Qisheng, et al.
Published: (2023)
by: Wang, Qisheng, et al.
Published: (2023)
Improved Lower Bounds for QAC0
by: Joshi, Malvika Raj, et al.
Published: (2025)
by: Joshi, Malvika Raj, et al.
Published: (2025)
King Chasing Problem in Chinese Chess is NP-hard
by: Li, Chao, et al.
Published: (2026)
by: Li, Chao, et al.
Published: (2026)
Quantum Lovász Local Lemma: Shearer's Bound is Tight
by: He, Kun, et al.
Published: (2018)
by: He, Kun, et al.
Published: (2018)
Improved Circuit Lower Bounds and Quantum-Classical Separations
by: Grewal, Sabee, et al.
Published: (2024)
by: Grewal, Sabee, et al.
Published: (2024)
Improved Lower Bounds for all Odd-Query Locally Decodable Codes
by: Basu, Arpon, et al.
Published: (2024)
by: Basu, Arpon, et al.
Published: (2024)
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)
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)
Lower Bounds for Approximate Sign Rank
by: Bindua, Riju, et al.
Published: (2026)
by: Bindua, Riju, et al.
Published: (2026)
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)
A Quadratic Lower Bound for Noncommutative Circuits
by: Shastri, Pratik
Published: (2026)
by: Shastri, Pratik
Published: (2026)
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)
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)
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers
by: Hakoniemi, Tuomas, et al.
Published: (2024)
by: Hakoniemi, Tuomas, et al.
Published: (2024)
Lower Bounds for Conjunctive Query Evaluation
by: Mengel, Stefan
Published: (2025)
by: Mengel, Stefan
Published: (2025)
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)
Tight Lower Bounds for Block-Structured Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2024)
by: Hunkenschröder, Christoph, 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)
Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies
by: Gajulapalli, Karthik, et al.
Published: (2025)
by: Gajulapalli, Karthik, et al.
Published: (2025)
Lower Bounds for Subset Sum in Resolution with Modular Counting
by: Part, Fedor
Published: (2022)
by: Part, Fedor
Published: (2022)
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)
Beating full state tomography for unentangled spectrum estimation
by: Pelecanos, Angelos, et al.
Published: (2025)
by: Pelecanos, Angelos, et al.
Published: (2025)
The Round Complexity of Proofs in the Bounded Quantum Storage Model
by: Grilo, Alex B., et al.
Published: (2024)
by: Grilo, Alex B., et al.
Published: (2024)
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)
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)
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)
Separations above TFNP from Sherali-Adams Lower Bounds
by: Fleming, Noah, et al.
Published: (2026)
by: Fleming, Noah, et al.
Published: (2026)
Lifting for Arbitrary Gadgets
by: Iyer, Siddharth
Published: (2025)
by: Iyer, Siddharth
Published: (2025)
Similar Items
-
Deterministic Lifting Theorems for One-Way Number-on-Forehead Communication
by: Yang, Guangxu, et al.
Published: (2025) -
Pointer Chasing with Unlimited Interaction
by: Fischer, Orr, et al.
Published: (2025) -
Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
by: Yang, Guangxu, et al.
Published: (2026) -
Quantum versus Classical Separation in Simultaneous Number-on-Forehead Communication
by: Yang, Guangxu, et al.
Published: (2025) -
A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
by: Wu, Xudong, et al.
Published: (2025)