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, ps, 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, ps, 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: 8 pages, 0 figures

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)