Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.14670 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
by: Gupta, Chetan, et al.
Published: (2025)
by: Gupta, Chetan, et al.
Published: (2025)
On Solving Reachability in Grid Digraphs using a Psuedoseparator
by: Jain, Rahul, et al.
Published: (2019)
by: Jain, Rahul, et al.
Published: (2019)
Trading Determinism for Time: The k-Reach Problem
by: Bhadra, Ronak, et al.
Published: (2024)
by: Bhadra, Ronak, et al.
Published: (2024)
Fully Characterizing Lossy Catalytic Computation
by: Folkertsma, Marten, et al.
Published: (2024)
by: Folkertsma, Marten, et al.
Published: (2024)
Lossy Cryptography from Code-Based Assumptions
by: Dao, Quang, et al.
Published: (2024)
by: Dao, Quang, et al.
Published: (2024)
Quantum information advantage based on Bell inequalities
by: Jain, Rahul, et al.
Published: (2026)
by: Jain, Rahul, et al.
Published: (2026)
Matrix Multiplication in the MPC Model
by: Joshi, Lakshya, et al.
Published: (2025)
by: Joshi, Lakshya, et al.
Published: (2025)
Understanding Robust Catalytic Computing
by: Koucký, Michal, et al.
Published: (2026)
by: Koucký, Michal, et al.
Published: (2026)
Computational complexity of isometric tensor network states
by: Malz, Daniel, et al.
Published: (2024)
by: Malz, Daniel, et al.
Published: (2024)
Parity $\notin$ QAC0 $\iff$ QAC0 is Fourier-Concentrated
by: Gretta, Lucas, et al.
Published: (2026)
by: Gretta, Lucas, et al.
Published: (2026)
Collapsing Catalytic Classes
by: Koucký, Michal, et al.
Published: (2025)
by: Koucký, Michal, et al.
Published: (2025)
Quantum Learning Theory Beyond Batch Binary Classification
by: Mohan, Preetham, et al.
Published: (2023)
by: Mohan, Preetham, et al.
Published: (2023)
The Computational Complexity of Factored Graphs
by: Gupta, Shreya, et al.
Published: (2024)
by: Gupta, Shreya, et al.
Published: (2024)
Derandomizing Isolation In Catalytic Logspace
by: Arvind, V., et al.
Published: (2025)
by: Arvind, V., et al.
Published: (2025)
Maximum Matching and Related Problems in Catalytic Logspace
by: Chakraborty, Srijan, et al.
Published: (2026)
by: Chakraborty, Srijan, et al.
Published: (2026)
The Complexity of Computing KKT Solutions of Quadratic Programs
by: Fearnley, John, et al.
Published: (2023)
by: Fearnley, John, et al.
Published: (2023)
Super Unique Tarski is in UEOPL
by: Fearnley, John, et al.
Published: (2024)
by: Fearnley, John, et al.
Published: (2024)
Area laws and tensor networks for maximally mixed ground states
by: Arad, Itai, et al.
Published: (2023)
by: Arad, Itai, et al.
Published: (2023)
Catalytic Computing and Register Programs Beyond Log-Depth
by: Alekseev, Yaroslav, et al.
Published: (2025)
by: Alekseev, Yaroslav, et al.
Published: (2025)
Communication Complexity is NP-hard
by: Hirahara, Shuichi, et al.
Published: (2025)
by: Hirahara, Shuichi, 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)
On Computability of Computable Problems
by: Khaliq, Asad
Published: (2023)
by: Khaliq, Asad
Published: (2023)
Efficient Catalytic Graph Algorithms
by: Cook, James, et al.
Published: (2025)
by: Cook, James, et al.
Published: (2025)
Bipartite Matching is in Catalytic Logspace
by: Agarwala, Aryan, et al.
Published: (2025)
by: Agarwala, Aryan, et al.
Published: (2025)
A Near-Optimal Polynomial Distance Lemma Over Boolean Slices
by: Amireddy, Prashanth, et al.
Published: (2025)
by: Amireddy, Prashanth, et al.
Published: (2025)
On Pigeonhole Principles and Ramsey in TFNP
by: Jain, Siddhartha, et al.
Published: (2024)
by: Jain, Siddhartha, et al.
Published: (2024)
From Proof Complexity to Circuit Complexity via Interactive Protocols
by: Arteche, Noel, et al.
Published: (2024)
by: Arteche, Noel, et al.
Published: (2024)
Constructive Separations and Their Consequences
by: Chen, Lijie, et al.
Published: (2022)
by: Chen, Lijie, et al.
Published: (2022)
An alignment problem
by: McDaniel, Emma L., et al.
Published: (2024)
by: McDaniel, Emma L., et al.
Published: (2024)
Local Correction of Linear Functions over the Boolean Cube
by: Amireddy, Prashanth, et al.
Published: (2024)
by: Amireddy, Prashanth, et al.
Published: (2024)
Low Degree Local Correction Over the Boolean Cube
by: Amireddy, Prashanth, et al.
Published: (2024)
by: Amireddy, Prashanth, et al.
Published: (2024)
Constant-Depth Unitary Preparation of Dicke States
by: Joshi, Malvika Raj, et al.
Published: (2026)
by: Joshi, Malvika Raj, et al.
Published: (2026)
Monotone Contractions
by: Batziou, Eleni, et al.
Published: (2024)
by: Batziou, Eleni, et al.
Published: (2024)
Ideals, Macaulay Bases, and PCPs
by: Amireddy, Prashanth, et al.
Published: (2025)
by: Amireddy, Prashanth, et al.
Published: (2025)
The Greedy Coin Change Problem
by: Gupta, Shreya, et al.
Published: (2024)
by: Gupta, Shreya, et al.
Published: (2024)
Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding under ETH
by: Gupta, Rishav, et al.
Published: (2026)
by: Gupta, Rishav, et al.
Published: (2026)
On the Principal Minor Expansion and Complexity of the Symmetrized Determinant
by: Agarwal, Sanyam, et al.
Published: (2026)
by: Agarwal, Sanyam, et al.
Published: (2026)
Equivalence of Countable and Computable
by: Zhang, Hantao
Published: (2024)
by: Zhang, Hantao
Published: (2024)
Almost-catalytic Computation
by: Bisoyi, Sagar, et al.
Published: (2024)
by: Bisoyi, Sagar, et al.
Published: (2024)
An Overview of the Theory of Instances Computational Complexity
by: Jorge A. Ruiz-Vanoye
Published: (2011)
by: Jorge A. Ruiz-Vanoye
Published: (2011)