Skip to main content

Computational Complexity

Authors and titles for recent submissions

See today's new changes

Total of 76 entries : 1-50 51-76
Showing up to 50 entries per page: fewer | more | all

Mon, 12 Oct 2026 (showing 7 of 7 entries )

[1] arXiv:2610.13585 [pdf, html, other]
Title: How far is Kolmogorov-Loveland randomness from Martin-Löf randomness?
Tomislav Petrović
Subjects: Computational Complexity (cs.CC); Information Theory (cs.IT)
[2] arXiv:2610.12804 [pdf, html, other]
Title: The Complexity of Finding Additional Solutions
Saman Farhat
Subjects: Computational Complexity (cs.CC)
[3] arXiv:2610.13906 (cross-list from quant-ph) [pdf, html, other]
Title: Quantum Query Complexity of Maximum Degree and its Generalizations
Amin Shiraz Gilani, Nikhil S. Mande, Subhasree Patro, Nithish Raja
Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC)
[4] arXiv:2610.13716 (cross-list from cs.GT) [pdf, html, other]
Title: Complexity of Autobidding Equilibria in GSP Sponsored Shopping
Kristoffer Arnsfelt Hansen, Yuhao Li, Xinhao Nie
Subjects: Computer Science and Game Theory (cs.GT); Computational Complexity (cs.CC)
[5] arXiv:2610.12991 (cross-list from cs.DS) [pdf, html, other]
Title: Dynamic Matching with Abandonment: Optimal Guarantees via Static Priority Policies
Nick Arnosti, Rad Niazadeh, Pranav Nuti, Felipe Simon
Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Computer Science and Game Theory (cs.GT); Theoretical Economics (econ.TH); Optimization and Control (math.OC)
[6] arXiv:2610.12664 (cross-list from quant-ph) [pdf, html, other]
Title: A Catalytic Algorithm for Transposing Unknown Qutrit Unitaries with Tight Query Bounds
Yu-Ao Chen
Comments: 31 pages, including supplementary material
Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)
[7] arXiv:2509.21469 (cross-list from quant-ph) [pdf, html, other]
Title: On the hardness of approximating minimum distances of quantum codes
Elena Grigorescu, Vatsal Jha, Eric Samperton
Comments: Accepted to FSTTCS25
Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC); Information Theory (cs.IT)

Fri, 9 Oct 2026 (showing 8 of 8 entries )

[8] arXiv:2610.12378 [pdf, html, other]
Title: On the Hardness of $4$-to-$1$ Games with Perfect Completeness
Yumou Fei, Dor Minzer, Shuo Wang
Subjects: Computational Complexity (cs.CC)
[9] arXiv:2610.11432 [pdf, html, other]
Title: Near-Inverse-Linear Barriers for Explicit Affine Witness Isolation
Sebastian Ben Daniel
Subjects: Computational Complexity (cs.CC)
[10] arXiv:2610.11823 (cross-list from math.RA) [pdf, html, other]
Title: The rank of $3\times 3$ matrix multiplication over $\mathbb{F}_2$ is 23
Tejasvi Singh Tomar
Comments: 14 pages. Programs, data and Lean formalization: this https URL (archived at this https URL). Also available at this https URL
Subjects: Rings and Algebras (math.RA); Computational Complexity (cs.CC)
[11] arXiv:2610.11481 (cross-list from cs.DS) [pdf, html, other]
Title: A QPTAS for Stochastic Scheduling of Bernoulli Jobs
Junho Hwang
Comments: 23 pages, 1 figure
Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Optimization and Control (math.OC)
[12] arXiv:2610.10911 (cross-list from math.OC) [pdf, html, other]
Title: Integer programming on polytopes of Chvátal rank one is as hard as lattice problems
Alberto Del Pia
Subjects: Optimization and Control (math.OC); Computational Complexity (cs.CC); Discrete Mathematics (cs.DM)
[13] arXiv:2610.10904 (cross-list from cs.DS) [pdf, html, other]
Title: $Ω((\log n/\log\log n)^2)$ Lower Bounds for Dynamic Graph Problems
Young Kun Ko
Comments: 29 pages, 2 figures
Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)
[14] arXiv:2610.10611 (cross-list from cs.AI) [pdf, html, other]
Title: Verification and Self-Improvement in Agentic AI: Foundations and Limits
Chien-Ping Lu
Comments: 26 pages, 5 figures. Includes proofs and reproducibility artifacts
Subjects: Artificial Intelligence (cs.AI); Computational Complexity (cs.CC)
[15] arXiv:2610.10593 (cross-list from cs.DS) [pdf, html, other]
Title: A faster matrix multiplication algorithm through structured optimization
Reza Zadeh
Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)

Thu, 8 Oct 2026 (showing 19 of 19 entries )

[16] arXiv:2610.10514 [pdf, html, other]
Title: $\exists \mathbb{R} \subseteq \textsf{CH}$
Alex Meiburg
Comments: 114 pages
Subjects: Computational Complexity (cs.CC); Computational Geometry (cs.CG)
[17] arXiv:2610.10477 [pdf, html, other]
Title: Primal/Dual Method for the Grothendieck Constant
Steven Heilman, Chris Jones, Giulio Malavolta
Subjects: Computational Complexity (cs.CC); Functional Analysis (math.FA)
[18] arXiv:2610.10399 [pdf, html, other]
Title: The smallest programmable machine and the hardness of analyzing it
J. Andres Montoya
Subjects: Computational Complexity (cs.CC)
[19] arXiv:2610.09434 [pdf, html, other]
Title: Optimal (Parallel) Spooky Pebbling on Binary Trees
Mingyu Lee, Sanghyun Lee, Kabgyun Jeong
Comments: 21 pages, 1 figure
Subjects: Computational Complexity (cs.CC)
[20] arXiv:2610.09290 [pdf, html, other]
Title: Improving the Constant in the Aharonov--Regev Theorem
Shuhong Gao
Subjects: Computational Complexity (cs.CC)
[21] arXiv:2610.09233 [pdf, html, other]
Title: Fine-Grained Hardness of Approximating Dynamic Time Warping
Jihan Wang
Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)
[22] arXiv:2610.09104 [pdf, html, other]
Title: On the Computational Complexity of Hidden Markov Model Identification
Markel Zubia, Nils Jansen
Subjects: Computational Complexity (cs.CC); Machine Learning (cs.LG); Statistics Theory (math.ST)
[23] arXiv:2610.09084 [pdf, html, other]
Title: On the complexity of the single-move labeled token routing problem
Nicolas Bousquet, Remy El Sabeh, Amer E. Mouawad, Naomi Nishimura
Comments: 53 pages, 8 figures
Subjects: Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS); Robotics (cs.RO); Combinatorics (math.CO)
[24] arXiv:2610.09065 [pdf, html, other]
Title: Separating comb inequalities is NP-hard
Yohan Finet, Victor Drouin-Touchette
Subjects: Computational Complexity (cs.CC)
[25] arXiv:2610.08988 [pdf, html, other]
Title: Associativity of Multiplication Is Hard for Resolution
Vincent Liew
Comments: 33 pages, 10 figures. Lean 4 formalization of the main theorems at this https URL
Subjects: Computational Complexity (cs.CC); Logic in Computer Science (cs.LO)
[26] arXiv:2610.10446 (cross-list from cs.DS) [pdf, html, other]
Title: Subset Sum via Partial Match
Lixi Ye, Baitian Li
Comments: 21 pages
Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)
[27] arXiv:2610.10319 (cross-list from cs.DS) [pdf, html, other]
Title: Polynomial Kernels for Interval Completion
Zimo Sheng, Tian Bai, Mingyu xiao
Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)
[28] arXiv:2610.10108 (cross-list from cs.IT) [pdf, html, other]
Title: The Multiple Unicast Conjecture is False
Mark Braverman, Zhongtian He
Subjects: Information Theory (cs.IT); Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS)
[29] arXiv:2610.09972 (cross-list from cs.DS) [pdf, html, other]
Title: A deterministic algorithm for signing bipartite graphs at the Ramanujan bound
Zhiqiang Xu
Comments: 18 pages
Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Combinatorics (math.CO)
[30] arXiv:2610.09584 (cross-list from quant-ph) [pdf, html, other]
Title: Quantum Approximation Complexity of Classical Optimization Problems
Stuart Hadfield
Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC)
[31] arXiv:2610.09166 (cross-list from cs.DS) [pdf, html, other]
Title: Lower Bounds for Parallel Diffusion Sampling
Yiwen Kou, Yimeng Wang
Subjects: Data Structures and Algorithms (cs.DS); Artificial Intelligence (cs.AI); Computational Complexity (cs.CC); Machine Learning (cs.LG); Machine Learning (stat.ML)
[32] arXiv:2610.09139 (cross-list from cs.AI) [pdf, html, other]
Title: Breaking the Space Barrier and its Application to Language Model Inference
Arip Asadulaev
Subjects: Artificial Intelligence (cs.AI); Computational Complexity (cs.CC)
[33] arXiv:2610.07351 (cross-list from cs.CR) [pdf, html, other]
Title: Simple Extremely Lossy Functions from Small-Exponent Hashing
Damiano Abram, Agni Datta, Archisman Dutta, Lawrence Roy
Subjects: Cryptography and Security (cs.CR); Computational Complexity (cs.CC)
[34] arXiv:2607.01227 (cross-list from quant-ph) [pdf, html, other]
Title: Polynomial equivalence of the global transverse-field Ising model and the gate model of quantum computation
Matthias Werner
Comments: 38 pages, 5 figures
Subjects: Quantum Physics (quant-ph); Quantum Gases (cond-mat.quant-gas); Computational Complexity (cs.CC)

Wed, 7 Oct 2026 (showing 10 of 10 entries )

[35] arXiv:2610.08610 [pdf, html, other]
Title: Reed-Solomon Codes at Capacity: Algorithmic List-Decoding and Proximity Gaps
Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi
Subjects: Computational Complexity (cs.CC); Information Theory (cs.IT)
[36] arXiv:2610.08207 [pdf, other]
Title: A Fast Algorithm for Maltsev Constraints
Victor Lagerkvist
Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)
[37] arXiv:2610.07455 [pdf, html, other]
Title: Cores Characterize the One-Pass Streaming Complexity of CSPs
Joshua Brakensiek, Aaron Putterman, Amatya Sharma, Santhoshini Velusamy
Subjects: Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS)
[38] arXiv:2610.07055 [pdf, html, other]
Title: Tarski Fixed Points in Quasi-FPT Queries
Xi Chen, Ruiquan Gao, Yuhao Li, Aviad Rubinstein, Mihalis Yannakakis
Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)
[39] arXiv:2610.08708 (cross-list from math.CO) [pdf, html, other]
Title: Optimal bound for the polynomial Littlewood-Offord problem
Alexandr Grebennikov
Comments: 9 pages
Subjects: Combinatorics (math.CO); Computational Complexity (cs.CC); Probability (math.PR)
[40] arXiv:2610.07858 (cross-list from cs.GT) [pdf, html, other]
Title: On the Complexity of Mixed Equilibria in First-Price Auctions with Correlated Priors
Mark Chen, Xi Chen, Hao Cui, William Pires, Jonah Stockwell
Subjects: Computer Science and Game Theory (cs.GT); Computational Complexity (cs.CC)
[41] arXiv:2610.07124 (cross-list from quant-ph) [pdf, html, other]
Title: Black Hole Radiation Decoding in the Haar Random Oracle Model
Ezekiel Cochran, Atul Mantri
Comments: 67 pages, 4 figures
Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC); Cryptography and Security (cs.CR)
[42] arXiv:2610.07119 (cross-list from cs.FL) [pdf, html, other]
Title: An Analysis of Decision Problems for Relational Pattern Languages under Various Constraints
Klaus Jansen, Dirk Nowotka, Lis Pirotton, Corinna Wambsganz, Max Wiedenhöft
Comments: In Proceedings AFL 2026, arXiv:2608.23071. A full version of this paper, containing all proofs, can be found at arXiv:2512.07476
Journal-ref: EPTCS 451, 2026, pp. 186-200
Subjects: Formal Languages and Automata Theory (cs.FL); Computational Complexity (cs.CC)
[43] arXiv:2610.06959 (cross-list from cs.DS) [pdf, html, other]
Title: Nearly optimal Personalized PageRank computation
Rong-Hua Li, Yichun Yang, Junjie Zhou
Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)
[44] arXiv:2610.06906 (cross-list from cs.DM) [pdf, html, other]
Title: Complexity, Bounds, and Exact Algorithms for Rainbow $k$-Domination in Regular Graphs
Piotr Lange
Subjects: Discrete Mathematics (cs.DM); Computational Complexity (cs.CC)

Tue, 6 Oct 2026 (showing first 6 of 32 entries )

[45] arXiv:2610.06740 [pdf, html, other]
Title: Separating ClonableQMA and QCMA Relative to a Classical Oracle
Alper Cakan, Kai-Min Chung, Wei-Hsiang Hung, Tzu-Yi Yang
Subjects: Computational Complexity (cs.CC); Quantum Physics (quant-ph)
[46] arXiv:2610.06092 [pdf, html, other]
Title: Fractal Gadgets for Neural Networks: The Complexity of the Narrow Regime
Olivier Bournez, Johanne Cohen, Laura Cohen, Adrian Wurm
Comments: 30 pages, 8 figures, Accepted at FSTTCS 2026
Subjects: Computational Complexity (cs.CC)
[47] arXiv:2610.05644 [pdf, html, other]
Title: Dimension Amplification for Tarski Fixed-Point Query Lower Bounds
Boyu Liu, Zihe Wang
Comments: 22 pages
Subjects: Computational Complexity (cs.CC)
[48] arXiv:2610.05430 [pdf, html, other]
Title: Strong Refutation for Random Quantum 3-SAT at Constant Density
Siu On Chan, Jeff Xu
Subjects: Computational Complexity (cs.CC)
[49] arXiv:2610.05412 [pdf, html, other]
Title: A Dichotomy for Planar Graph Homomorphisms with Nonnegative Weights
Chenghua Liu, Boning Meng
Comments: 29 pages. Lean 4 formalization: this https URL
Subjects: Computational Complexity (cs.CC)
[50] arXiv:2610.05385 [pdf, html, other]
Title: On the Computational Complexity of Problems: Formalizing Sensitivity to Uncertainty and Parametric Complexity Classes
Yannis Tzitzikas
Comments: 35 pages
Subjects: Computational Complexity (cs.CC)
Total of 76 entries : 1-50 51-76
Showing up to 50 entries per page: fewer | more | all