Computational Complexity

Authors and titles for cs.CC in Mar 2024

[1]  arXiv:2403.00098 [pdf, other]

Title: On the Counting Complexity of the Skolem Problem

Authors: Gorav Jindal, Joël Ouaknine

Subjects: Computational Complexity (cs.CC); Logic in Computer Science (cs.LO)

[2]  arXiv:2403.00115 [pdf, ps, other]

Title: PosSLP and Sum of Squares

Authors: Markus Bläser, Julian Dörfler, Gorav Jindal

Subjects: Computational Complexity (cs.CC); Discrete Mathematics (cs.DM)

[3]  arXiv:2403.00390 [pdf, ps, other]

Title: Deterministic Weighted Automata under Partial Observability

Authors: Jakub Michaliszyn, Jan Otop

Subjects: Computational Complexity (cs.CC)

[4]  arXiv:2403.00497 [pdf, ps, other]

Title: Graph Homomorphism, Monotone Classes and Bounded Pathwidth

Authors: Tala Eagling-Vose, Barnaby Martin, Daniel Paulusma, Mark Siggers, Siani Smith

Subjects: Computational Complexity (cs.CC); Logic in Computer Science (cs.LO)

[5]  arXiv:2403.01662 [pdf, ps, other]

Title: Atropos-k is PSPACE-complete

Authors: Chao Yang, Zhujun Zhang

Subjects: Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Combinatorics (math.CO)

[6]  arXiv:2403.01965 [pdf, ps, other]

Title: Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits

Authors: Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk

Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)

[7]  arXiv:2403.02275 [pdf, other]

Title: Bounded Depth Frege Lower Bounds for Random 3-CNFs via Deterministic Restrictions

Authors: Svyatoslav Gryaznov, Navid Talebanfard

Subjects: Computational Complexity (cs.CC)

[8]  arXiv:2403.02499 [pdf, other]

Title: The complexity of computing in continuous time: space complexity is precision

Authors: Manon Blanc, Olivier Bournez

Subjects: Computational Complexity (cs.CC)

[9]  arXiv:2403.03530 [pdf, other]

Title: Average-case deterministic query complexity of boolean functions with fixed weight

Authors: Yuan Li, Haowei Wu, Yi Yang

Subjects: Computational Complexity (cs.CC)

[10]  arXiv:2403.03933 [pdf, ps, other]

Title: Polynomial Calculus sizes over the Boolean and Fourier bases are incomparable

Authors: Sasank Mouli

Subjects: Computational Complexity (cs.CC); Logic (math.LO)

[11]  arXiv:2403.04694 [pdf, other]

Title: On $[1,2]$-Domination in Interval and Circle Graphs

Authors: Mohsen Alambardar Meybodi, Abolfazl Poureidi

Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS); Combinatorics (math.CO)

[12]  arXiv:2403.04955 [pdf, other]

Title: A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers

Authors: Kyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng

Comments: 17 pages

Subjects: Computational Complexity (cs.CC); Combinatorics (math.CO)

[13]  arXiv:2403.06248 [pdf, other]

Title: Spectral Lower Bounds for Local Search

Authors: Simina Brânzei, Nicholas J. Recker

Comments: arXiv admin note: text overlap with arXiv:2305.08269

Subjects: Computational Complexity (cs.CC)

[14]  arXiv:2403.07239 [pdf, other]

Title: The Primal Pathwidth SETH

Authors: Michael Lampis

Comments: 90 pages

Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)

[15]  arXiv:2403.09134 [pdf, other]

Title: Local Enumeration and Majority Lower Bounds

Authors: Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael Saks, Navid Talebanfard

Subjects: Computational Complexity (cs.CC)

[16]  arXiv:2403.09145 [pdf, ps, other]

Title: Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems

Authors: Tomoyuki Yamakami

Comments: (A4, 10pt, 17 pages) An extended abstract of this current article is scheduled to appear in the Proceedings of the 12th Computing Conference, London, UK, July 11--12, 2024, Lecture Notes in Networks and Systems, Springer-Verlag, 2024

Subjects: Computational Complexity (cs.CC); Formal Languages and Automata Theory (cs.FL); Symbolic Computation (cs.SC)

[17]  arXiv:2403.09994 [pdf, other]

Title: Even quantum advice is unlikely to solve PP

Authors: Justin Yirka

Comments: 10 pages, 0 figures. Added exposition and corrected arithmetic errors in v2

Subjects: Computational Complexity (cs.CC); Quantum Physics (quant-ph)

[18]  arXiv:2403.11941 [pdf, ps, other]

Title: Perfect Zero-Knowledge PCPs for #P

Authors: Tom Gur, Jack O'Connor, Nicholas Spooner

Subjects: Computational Complexity (cs.CC); Cryptography and Security (cs.CR); Data Structures and Algorithms (cs.DS)

[19]  arXiv:2403.12716 [pdf, ps, other]

Title: A New Reduction Method from Multivariate Polynomials to Univariate Polynomials

Authors: Cancan Wang, Ming Su, Gang Wang, Qingpo Zhang

Comments: 15 pages

Subjects: Computational Complexity (cs.CC)

[20]  arXiv:2403.14150 [pdf, other]

Title: A combinatorial view of Holant problems on higher domains

Authors: Yin Liu

Subjects: Computational Complexity (cs.CC); Combinatorics (math.CO)

[21]  arXiv:2403.14217 [pdf, ps, other]

Title: Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead

Authors: Mark Jones, Jannik Schestag

Subjects: Computational Complexity (cs.CC)

[22]  arXiv:2403.19401 [pdf, ps, other]

Title: Hardness of Learning Boolean Functions from Label Proportions

Authors: Venkatesan Guruswami, Rishi Saket

Comments: 17 pages. Conference version of this paper appeared in FSTTCS 2023

Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG)

[23]  arXiv:2403.19680 [pdf, other]

Title: A (1.999999)-approximation ratio for vertex cover problem

Authors: Majid Zohrehbandian

Subjects: Computational Complexity (cs.CC)

[24]  arXiv:2403.19911 [pdf, ps, other]

Title: Computing a Fixed Point of Contraction Maps in Polynomial Queries

Authors: Xi Chen, Yuhao Li, Mihalis Yannakakis

Comments: To appear in STOC'24

Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS); Computer Science and Game Theory (cs.GT)

[25]  arXiv:2403.20000 [pdf, ps, other]

Title: Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse

Authors: Marcel Jackiewicz, Adam Kasperski, Paweł Zieliński

Subjects: Computational Complexity (cs.CC)

[26]  arXiv:2403.20283 [pdf, ps, other]

Title: A New Information Complexity Measure for Multi-pass Streaming with Applications

Authors: Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, Jiapeng Zhang

Comments: To appear in STOC 2024

Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)

[27]  arXiv:2403.20305 [pdf, ps, other]

Title: Local Correction of Linear Functions over the Boolean Cube

Authors: Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan

Comments: 61 pages, To Appear in the Proceedings of the 56th Annual ACM Symposium on Theory of Computing, June 24-28 2024, Vancouver, Canada. Added a remark on local testing in the revision

Subjects: Computational Complexity (cs.CC)

[28]  arXiv:2403.00643 (cross-list from cs.DS) [pdf, ps, other]

Title: Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number

Authors: Pascal Koiran, Subhayan Saha

Comments: 55 pages

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Numerical Analysis (math.NA)

[29]  arXiv:2403.01162 (cross-list from cs.GT) [pdf, ps, other]

Title: Envy-Free House Allocation with Minimum Subsidy

Authors: Davin Choo, Yan Hao Ling, Warut Suksompong, Nicholas Teh, Jian Zhang

Journal-ref: Operations Research Letters, 54:107103 (2024)

Subjects: Computer Science and Game Theory (cs.GT); Computational Complexity (cs.CC)

[30]  arXiv:2403.01903 (cross-list from cs.DC) [pdf, other]

Title: Online Locality Meets Distributed Quantum Computing

Authors: Amirreza Akbari, Xavier Coiteux-Roy, Francesco d'Amore, François Le Gall, Henrik Lievonen, Darya Melnyk, Augusto Modanese, Shreyas Pai, Marc-Olivier Renou, Václav Rozhoň, Jukka Suomela

Comments: 60 pages, 10 figures. This version corrects a mistake in v1

Subjects: Distributed, Parallel, and Cluster Computing (cs.DC); Computational Complexity (cs.CC); Probability (math.PR); Quantum Physics (quant-ph)

[31]  arXiv:2403.02198 (cross-list from cs.DM) [pdf, ps, other]

Title: Payment Scheduling in the Interval Debt Model

Authors: Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan

Comments: 30 pages, 17 figures

Subjects: Discrete Mathematics (cs.DM); Computational Complexity (cs.CC); Computational Engineering, Finance, and Science (cs.CE)

[32]  arXiv:2403.03651 (cross-list from cs.IT) [pdf, ps, other]

Title: Maximally Extendable Sheaf Codes

Authors: Pavel Panteleev, Gleb Kalachev

Comments: 17 pages

Subjects: Information Theory (cs.IT); Computational Complexity (cs.CC); Quantum Physics (quant-ph)

[33]  arXiv:2403.05074 (cross-list from cs.DS) [pdf, other]

Title: Single Family Algebra Operation on ZDDs Leads To Exponential Blow-Up

Authors: Kengo Nakamura, Masaaki Nishino, Shuhei Denzumi

Comments: 19 pages, 6 figures

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)

[34]  arXiv:2403.06580 (cross-list from cs.DS) [pdf, ps, other]

Title: Arborescences and Shortest Path Trees when Colors Matter

Authors: P. S. Ardra, Jasine Babu, Kritika Kashyap, R. Krithika, Sreejith K. Pallathumadam, Deepak Rajendraprasad

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Discrete Mathematics (cs.DM)

[35]  arXiv:2403.06608 (cross-list from cs.DS) [pdf, ps, other]

Title: Balanced Substructures in Bicolored Graphs

Authors: P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma

Comments: Minor changes

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)

[36]  arXiv:2403.07200 (cross-list from cs.CG) [pdf, ps, other]

Title: Computing $p$-presentation distances is hard

Authors: Håvard Bakke Bjerkevik, Magnus Bakke Botnan

Comments: 28 pages, 7 figures

Subjects: Computational Geometry (cs.CG); Computational Complexity (cs.CC); Representation Theory (math.RT)

[37]  arXiv:2403.07524 (cross-list from cs.DS) [pdf, other]

Title: Shining Light on Periodic Dominating Sets in Bounded-Treewidth Graphs

Authors: Jakob Greilhuber, Philipp Schepper, Philip Wellnitz

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)

[38]  arXiv:2403.09728 (cross-list from cs.CL) [pdf, other]

Title: Simulating Weighted Automata over Sequences and Trees with Transformers

Authors: Michael Rizvi, Maude Lizaire, Clara Lacroce, Guillaume Rabusseau

Subjects: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Computational Complexity (cs.CC)

[39]  arXiv:2403.10063 (cross-list from cs.LG) [pdf, other]

Title: Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization

Authors: Mohammad Pedramfar, Yididiya Y. Nadew, Christopher J. Quinn, Vaneet Aggarwal

Comments: This paper is published in ICLR 2024. This version includes a correction for regret bounds in the full-information zeroth order feedback setting (see the footnote on page 1 for details)

Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computational Complexity (cs.CC); Optimization and Control (math.OC)

[40]  arXiv:2403.11307 (cross-list from cs.NE) [pdf, ps, other]

Title: An upper bound of the mutation probability in the genetic algorithm for general 0-1 knapsack problem

Authors: Yang Yang

Subjects: Neural and Evolutionary Computing (cs.NE); Computational Complexity (cs.CC); Computer Science and Game Theory (cs.GT)

[41]  arXiv:2403.11320 (cross-list from cs.DS) [pdf, ps, other]

Title: A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients

Authors: Yang Yang

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)

[42]  arXiv:2403.11749 (cross-list from cs.CG) [pdf, other]

Title: Computing shortest closed curves on non-orientable surfaces

Authors: Denys Bulavka, Éric Colin de Verdière, Niloufar Fuladi

Comments: To appear at SoCG 2024

Subjects: Computational Geometry (cs.CG); Computational Complexity (cs.CC); Geometric Topology (math.GT)

[43]  arXiv:2403.12213 (cross-list from cs.DS) [pdf, ps, other]

Title: Private graphon estimation via sum-of-squares

Authors: Hongjie Chen, Jingqiu Ding, Tommaso d'Orsi, Yiding Hua, Chih-Hung Liu, David Steurer

Comments: 71 pages, accepted to STOC 2024

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Machine Learning (cs.LG); Machine Learning (stat.ML)

[44]  arXiv:2403.15871 (cross-list from cs.DS) [pdf, ps, other]

Title: On the complexity and approximability of Bounded access Lempel Ziv coding

Authors: Ferdinando Cicalese, Francesca Ugazio

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)

[45]  arXiv:2403.16757 (cross-list from cs.CR) [pdf, ps, other]

Title: Bi-objective Optimization in Role Mining

Authors: Jason Crampton, Eduard Eiben, Gregory Gutin, Daniel Karapetyan, Diptapriyo Majumdar

Subjects: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Computational Complexity (cs.CC)

[46]  arXiv:2403.19817 (cross-list from cs.IT) [pdf, ps, other]

Title: Kolmogorov-Loveland betting strategies lose the Betting game on open sets

Authors: Tomislav Petrović

Subjects: Information Theory (cs.IT); Computational Complexity (cs.CC)

[47]  arXiv:2403.00182 (cross-list from quant-ph) [pdf, ps, other]

Title: SAT, Gadgets, Max2XOR, and Quantum Annealers

Authors: Carlos Ansótegui, Jordi Levy

Comments: arXiv admin note: text overlap with arXiv:2204.01774

Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC); Logic in Computer Science (cs.LO)

[48]  arXiv:2403.02532 (cross-list from quant-ph) [pdf, other]

Title: Superposition detection and QMA with non-collapsing measurements

Authors: Roozbeh Bassirian, Kunal Marwaha

Comments: 12 pages, 1 figure

Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC)

[49]  arXiv:2403.02543 (cross-list from quant-ph) [pdf, ps, other]

Title: PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements

Authors: Scott Aaronson, Sabee Grewal, Vishnu Iyer, Simon C. Marshall, Ronak Ramachandran

Comments: 15 pages

Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC)

[50]  arXiv:2403.02937 (cross-list from quant-ph) [pdf, ps, other]

Title: Quantum Algorithms in a Superposition of Spacetimes

Authors: Omri Shmueli

Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC)