Saved in:
| Main Authors: | Bhattacharjee, Somnath, Kumar, Mrinal, Ramanathan, Varun, Saptharishi, Ramprasad, Saraf, Shubhangi |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.08063 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
by: Kumar, Mrinal, et al.
Published: (2024)
by: Kumar, Mrinal, et al.
Published: (2024)
Constant-depth circuits for polynomial GCD over any characteristic
by: Bhattacharjee, Somnath, et al.
Published: (2025)
by: Bhattacharjee, Somnath, et al.
Published: (2025)
Closure under factorization from a result of Furstenberg
by: Bhattacharjee, Somnath, et al.
Published: (2025)
by: Bhattacharjee, Somnath, et al.
Published: (2025)
A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
by: Yang, Yang
Published: (2024)
by: Yang, Yang
Published: (2024)
Deterministic Independent Sets in the Semi-Streaming Model
by: Ye, Daniel
Published: (2025)
by: Ye, Daniel
Published: (2025)
Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)
by: Zhou, Guangyan
Published: (2026)
Tight Streaming Lower Bounds for Deterministic Approximate Counting
by: Wang, Yichuan
Published: (2024)
by: Wang, Yichuan
Published: (2024)
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting
by: Grossman, Ofer, et al.
Published: (2023)
by: Grossman, Ofer, et al.
Published: (2023)
Kronecker scaling of tensors with applications to arithmetic circuits and algorithms
by: Björklund, Andreas, et al.
Published: (2025)
by: Björklund, Andreas, et al.
Published: (2025)
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)
NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
by: Gaspers, Serge, et al.
Published: (2025)
by: Gaspers, Serge, et al.
Published: (2025)
Most Juntas Saturate the Hardcore Lemma
by: Kumar, Vinayak M.
Published: (2025)
by: Kumar, Vinayak M.
Published: (2025)
Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields
by: Rai, Shanthanu S
Published: (2024)
by: Rai, Shanthanu S
Published: (2024)
Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
by: Gaikwad, Ajinkya, et al.
Published: (2025)
by: Gaikwad, Ajinkya, et al.
Published: (2025)
The complexity of testing all properties of planar graphs, and the role of isomorphism
by: Basu, Sabyasachi, et al.
Published: (2021)
by: Basu, Sabyasachi, et al.
Published: (2021)
Parameterized Algorithms for Editing to Uniform Cluster Graph
by: Gaikwad, Ajinkya, et al.
Published: (2024)
by: Gaikwad, Ajinkya, et al.
Published: (2024)
Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
by: Chen, Shengminjie, et al.
Published: (2026)
by: Chen, Shengminjie, et al.
Published: (2026)
Precoloring extension with demands on paths
by: Das, Arun Kumar, et al.
Published: (2025)
by: Das, Arun Kumar, et al.
Published: (2025)
Linear Hashing Is Optimal
by: Jaber, Michael, et al.
Published: (2025)
by: Jaber, Michael, et al.
Published: (2025)
On the Parameterized Complexity of Min-Sum-Radii
by: Kumar, Pankaj, et al.
Published: (2026)
by: Kumar, Pankaj, et al.
Published: (2026)
A quantum neural network framework for scalable quantum circuit approximation of unitary matrices
by: Sarkar, Rohit Sarma, et al.
Published: (2024)
by: Sarkar, Rohit Sarma, et al.
Published: (2024)
A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization
by: Umans, Chris, et al.
Published: (2025)
by: Umans, Chris, et al.
Published: (2025)
Constant congestion linkages in polynomially strong digraphs in polynomial time
by: Lopes, Raul, et al.
Published: (2024)
by: Lopes, Raul, et al.
Published: (2024)
On the complexity of global Roman domination problem in graphs
by: Reddy, Sangam Balchandar, et al.
Published: (2026)
by: Reddy, Sangam Balchandar, et al.
Published: (2026)
The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
by: Greilhuber, Jakob, et al.
Published: (2025)
by: Greilhuber, Jakob, et al.
Published: (2025)
The Trichotomy of Regular Property Testing
by: Bathie, Gabriel, et al.
Published: (2025)
by: Bathie, Gabriel, et al.
Published: (2025)
Downward self-reducibility in the total function polynomial hierarchy
by: Gajulapalli, Karthik, et al.
Published: (2025)
by: Gajulapalli, Karthik, et al.
Published: (2025)
Tight Additive Sensitivity on LZ-style Compressors and String Attractors
by: Fujie, Yuto, et al.
Published: (2025)
by: Fujie, Yuto, et al.
Published: (2025)
Sublinear-Time Approximation for Graph Frequency Vectors in Hyperfinite Graphs
by: Moroie, Gregory
Published: (2025)
by: Moroie, Gregory
Published: (2025)
A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
by: Gholizadeh, Hossein, et al.
Published: (2025)
by: Gholizadeh, Hossein, et al.
Published: (2025)
Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
by: Herrmann, Anton, et al.
Published: (2025)
by: Herrmann, Anton, et al.
Published: (2025)
Better Bounds for Semi-Streaming Single-Source Shortest Paths
by: Assadi, Sepehr, et al.
Published: (2025)
by: Assadi, Sepehr, et al.
Published: (2025)
Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
by: Maalouly, Nicolas El, et al.
Published: (2025)
by: Maalouly, Nicolas El, et al.
Published: (2025)
k-SUM Hardness Implies Treewidth-SETH
by: Lampis, Michael
Published: (2025)
by: Lampis, Michael
Published: (2025)
Efficient Catalytic Graph Algorithms
by: Cook, James, et al.
Published: (2025)
by: Cook, James, et al.
Published: (2025)
Minimizing Envy and Maximizing Happiness in Graphical House Allocation
by: Dhar, Anubhav, et al.
Published: (2025)
by: Dhar, Anubhav, et al.
Published: (2025)
Scheduling Problems with Constrained Rejections
by: Davies, Sami, et al.
Published: (2025)
by: Davies, Sami, et al.
Published: (2025)
Graded Projection Recursion (GPR): Corrections, Obstructions, and Conservative Approximate Matrix Multiplication
by: Uhlmann, Jeffrey
Published: (2025)
by: Uhlmann, Jeffrey
Published: (2025)
Parameterized Complexity of Vehicle Routing
by: Döring, Michelle, et al.
Published: (2025)
by: Döring, Michelle, et al.
Published: (2025)
Geometric Interpretation of 3-SAT and Phase Transition
by: Gillet, Frederic
Published: (2025)
by: Gillet, Frederic
Published: (2025)
Similar Items
-
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
by: Kumar, Mrinal, et al.
Published: (2024) -
Constant-depth circuits for polynomial GCD over any characteristic
by: Bhattacharjee, Somnath, et al.
Published: (2025) -
Closure under factorization from a result of Furstenberg
by: Bhattacharjee, Somnath, et al.
Published: (2025) -
A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
by: Yang, Yang
Published: (2024) -
Deterministic Independent Sets in the Semi-Streaming Model
by: Ye, Daniel
Published: (2025)