Learning-Augmented Algorithms for Boolean Satisfiability

Autori: Attias, Idan, Gao, Xing, Reyzin, Lev

Soggetti: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, Computer Science - Machine Learning

URL di accesso: http://arxiv.org/abs/2505.06146

Second Price Matching with Complete Allocation and Degree Constraints

Autori: Pinchasi, Rom, Singer, Neta, Vogl, Lukas, Wei, Jiaye

Soggetti: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, Computer Science - Discrete Mathematics

URL di accesso: http://arxiv.org/abs/2505.06005

Gap-preserving reductions and RE-completeness of independent set games

Autori: Mančinska, Laura, Spaas, Pieter, Spirig, Taro

Soggetti: Quantum Physics, Computer Science - Computational Complexity, Mathematics - Operator Algebras

URL di accesso: http://arxiv.org/abs/2505.05253

A Critique of Lin's 'On $\text{NP}$ versus $\text{coNP}$ and Frege Systems'

Autori: DeJesse, Nicholas, Lyudovyk, Spencer, Pai, Dhruv, Reidy, Michael

Soggetti: Computer Science - Computational Complexity

URL di accesso: http://arxiv.org/abs/2505.05658

Testing Juntas Optimally with Samples

Autori: Beretta, Lorenzo, Harms, Nathaniel, Koch, Caleb

Soggetti: Computer Science - Machine Learning, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Statistics - Machine Learning

URL di accesso: http://arxiv.org/abs/2505.04604

On the Equivalence of Gaussian Graphical Models Defined on Complete Bipartite Graphs

Autori: Molkaraie, Mehdi

Soggetti: Computer Science - Information Theory, Computer Science - Computational Complexity, Statistics - Computation

URL di accesso: http://arxiv.org/abs/2505.02384

Proof Complexity and Feasible Interpolation

Autori: Tabatabai, Amirhossein Akbar

Soggetti: Mathematics - Logic, Computer Science - Computational Complexity

URL di accesso: http://arxiv.org/abs/2505.03002

PLS-completeness of string permutations

Autori: Scheder, Dominik, Tantow, Johannes

Soggetti: Computer Science - Computational Complexity

URL di accesso: http://arxiv.org/abs/2505.02622

Computational Irreducibility as the Foundation of Agency: A Formal Model Connecting Undecidability to Autonomous Behavior in Complex Systems

Autori: Azadi, Poria

Soggetti: Computer Science - Artificial Intelligence, Computer Science - Computational Complexity, Computer Science - Information Theory

URL di accesso: http://arxiv.org/abs/2505.04646

On optimal distinguishers for Planted Clique

Autori: Nagda, Ansh, Raghavendra, Prasad

Soggetti: Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms

URL di accesso: http://arxiv.org/abs/2505.01990

More efficient sifting for grid norms, and applications to multiparty communication complexity

Autori: Kelley, Zander, Lyu, Xin

Soggetti: Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Mathematics - Combinatorics

URL di accesso: http://arxiv.org/abs/2505.01587

The tape reconfiguration problem and its consequences for dominating set reconfiguration

Autori: Bousquet, Nicolas, Deschamps, Quentin, Mary, Arnaud, Mouawad, Amer E., Pierron, Théo

Soggetti: Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics

URL di accesso: http://arxiv.org/abs/2505.00988

Orbit-blocking words in free groups

Autori: Koch-Hyde, Lucy, O'Connor, Siobhan, Olive, Eamonn, Shpilrain, Vladimir

Soggetti: Mathematics - Group Theory, Computer Science - Computational Complexity

URL di accesso: http://arxiv.org/abs/2505.00477

On estimating the quantum $\ell_{\alpha}$ distance

Autori: Liu, Yupan, Wang, Qisheng

Soggetti: Quantum Physics, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms

URL di accesso: http://arxiv.org/abs/2505.00457

The Complexity of Minimum-Envy House Allocation Over Graphs

Autori: Dey, Palash, Dhar, Anubhav, Hota, Ashlesha, Kolay, Sudeshna

Soggetti: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity

URL di accesso: http://arxiv.org/abs/2505.00296

The Planted Orthogonal Vectors Problem

Autori: Kühnemann, David, Polak, Adam, Rosen, Alon

Soggetti: Computer Science - Computational Complexity, Computer Science - Cryptography and Security, Computer Science - Data Structures and Algorithms

URL di accesso: http://arxiv.org/abs/2505.00206

On the Space Complexity of Online Convolution

Autori: Andersson, Joel Daniel, Yehudayoff, Amir

Soggetti: Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms

URL di accesso: http://arxiv.org/abs/2505.00181

One-way Communication Complexity of Minimum Vertex Cover in General Graphs

Autori: Derakhshan, Mahsa, Ghasemi, Andisheh, Rajaraman, Rajmohan

Soggetti: Computer Science - Computational Complexity

URL di accesso: http://arxiv.org/abs/2505.00164

Computational Complexity of UAP Reverse Engineering: A Formal Analysis of Automaton Identification and Data Complexity

Autori: Daghbouche, Karim

Fonte: J.Acad. (N.Y.) 2025, Vol. 14, 1:3-15

Soggetti: Computer Science - Computational Complexity

URL di accesso: http://arxiv.org/abs/2505.00051

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings

Autori: Vu, Thi Xuan

Soggetti: Computer Science - Symbolic Computation, Computer Science - Computational Complexity, Mathematics - Algebraic Geometry

URL di accesso: http://arxiv.org/abs/2504.21708