Complexity

This paper proves that the satisfiability problem of existential Presburger arithmetic extended with divisibility predicates (EPAD) is PP-hard.

The paper proposes 'Explainable PQC,' a layered interpretive framework designed to structure and clarify how post-quantum cryptographic security assumptions are represented and communicated, particula…

This paper shows that finding the minimum geodetic set in chordal graphs is fixed parameter tractable, implying a polynomial-time algorithm for k-trees. It also proves that the problem is NP-hard on i…

The paper shows that the envy-free cake-cutting problem with three agents is intractable and establishes the first lower bounds for the Jordan curve problem.

This paper studies the autarky problem of scheduling energy-consuming jobs with time windows using a battery and an energy forecast, and shows NP-hardness, polynomial-time solvability, and fixed-param…

This paper establishes a finite combinatorial version of Gödel's incompleteness theorems in Boolean $K$-SAT, resolving assignment correlations and constructing structurally irreducible SAT/UNSAT pairs…

The paper proves an information-theoretically optimal gap-majority lemma in the two-player randomized communication model, achieving the correct linear scaling and constant-constant tradeoff.

The polynomial-time low-degree conjecture, which predicts that low-degree indistinguishability, a uniform null distribution, permutation invariance, and independent resampling imply polynomial-time ha…

The paper analyzes low-degree estimation thresholds for recovering hidden signals in planted hypergraphs and tensor PCA, establishing sharp phase transitions and providing polynomial-time recovery alg…

The paper presents a new worst-case to average-case reduction for the Learning Parity with Noise (LPN) problem, achieving hardness for inverse-polynomial noise rates previously unattainable.

The paper investigates the relationship between graph classes, edit cost functions, and computational complexity of the graph edit distance, providing polynomial-time reductions and correspondences.

This paper studies a variant of the quantum XOR game model, called tilted XOR games, and shows that approximating their quantum value to constant precision is RE-complete.

This paper derives Cramér-Rao lower bounds for cooperative MIMO integrated sensing and communication networks, considering position and velocity coupling in the Fisher information matrix.

This paper studies approximation algorithms for minimizing power losses in electrical distribution networks, proving hardness results and providing approximations for various configurations.

This paper studies the complexity of the graph homomorphism problem in terms of the degeneracy of the target graph and shows that under ETH, there is no efficient algorithm for this problem.

This paper analyzes the computational complexity of verifying feedforward neural networks when their weights are restricted to finite-width arithmetic, finding that verification remains NP-complete fo…

This paper proposes multi-carrier positioning frameworks for pinching-antenna systems using matrix pencil-based and Rank-1 ranging algorithms, and a two-stage weighted nonlinear least-squares position…

The paper introduces a diffusion-based uncertainty model for robust optimization on graphs, showing that the resulting computational complexity depends critically on the interaction between the uncert…

This paper studies distribution testing with respect to bounded classes of distinguishers, revealing connections between testable learning, verification of learning algorithms, and testing of structur…

This paper studies the computational complexity of Maximum Edge Open Packing Problem in distance-hereditary, biconvex bipartite, and chordal graphs, providing polynomial-time algorithms and a fixed-pa…