Theory & Algorithms · Computer Science & AI
Computational Complexity
The newest papers in Computational Complexity that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
343 papers, from 31 August 2026 to 5 November 2026: 282 arXiv preprints and 61 OpenAlex records.
Get the few papers worth your time in Computational Complexity every morning.
Follow Computational Complexity and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 14
Complexity Barriers to State Preparation in Quantum Approximate Optimization
For many important optimization problems we are restricted to approximate solutions in practice due to computational complexity.Probing the classical complexity of quantum dynamics experiments
A confluence of recent works has shown that many quantum circuits and dynamics are efficiently simulable by classical algorithms that track local information, even when conventional complexity…Claim-Gated Source-Risk Auditing for Generative Search
A generative search answer can cite a supported passage yet omit a source relationship that changes its interpretation.A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth
The $k$ vertex-disjoint paths problem asks whether, given a graph $G$ and $k$ pairs of vertices $(s_1,t_1)$, \ldots, $(s_k,t_k)$, $G$ has $k$ pairwise vertex-disjoint paths connecting $s_i$ and…On Kernels and Leaves: Searching for Bare and Lush Trees
We study a variation of the classical Maximum (Minimum) Leaf Spanning Tree problem.A New Gap Sequence for Shellsort: RL-Driven Algorithm Discovery Beyond $N^{4/3}$
Choosing Shellsort gaps is a well-known open problem.From FPT to W[P]: Classifying Zero Forcing, Power Domination and Their Variants
Zero Forcing (ZF) and Power Dominating Set (PDS) mark vertices in a graph based on a common forcing process starting from a problem-specific set of initially marked vertices.On the SoS Certifiability of Log-Concave Distributions
For an arbitrary isotropic log-concave distribution $P$ on $\mathbb{R}^d$, we prove that the polynomial $(Cm)^m\|v\|_2^m - \mathbb{E}_{X\sim P}\langle X,v\rangle^m$ is a sum of squares for every…A General Composition Theorem for Approximate Degree
A longstanding open question in Boolean function complexity asks whether approximate degree composes multiplicatively under block composition.Optimal spectrum estimation
We prove that the spectrum of an unknown $d$-dimensional quantum state can be estimated to error $\varepsilon$ in total variation distance using \[ O\!\left(d^2\min\left\{ \frac{1}{(\varepsilon\log…Duality for matrix space questions
We present a new proof of a classical theorem of Dieudonné: if a linear space of $n\times n$ matrices consists entirely of singular matrices, then its dimension is at most $n^2-n$.Vertex-Coloring Edge-Weighting: Kernelization and Generalization
An edge weighting of a graph induces a coloring of its vertices in which the color of a vertex is the total weight of the edges incident with it.Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs
For every fixed integers $r \ge 4$ and $2 \le k \le r-2$, we construct $r$-dimensional cubical sheaf complexes whose degree-$k$ CSS codes have positive constant rate, linear distance, and constant…Biplanar graphs with independence number two are 9-colorable
A graph is biplanar if it is the union of two planar graphs on the same vertex set.$\mathsf{BQP} \subseteq \mathsf{IP}$ Does Not Relativize
We construct an oracle relative to which $\mathsf{BQP} \not\subseteq \mathsf{IP}$, resolving a long-standing open question in quantum complexity theory.Improved Algorithms for the Remote Point Problem
The Remote Point Problem (RPP) is an algorithmic problem that asks, given a linear subspace $L \subseteq \mathbb{F}^n$ of dimension $k$, to deterministically find a vector $v \in \mathbb{F}^n$ far…Latest Exact Match Attention
We introduce latest exact match attention (LEMA), an attention variant for transformers where queries and keys are binarized and each query attends only to the latest exactly matching key.Exponential Quantum Advantage in Testing Fourier Dimensionality
A boolean function $f$ has Fourier dimension $k$ if its nonzero Fourier coefficients span a subspace of dimension $k$.On the Computational Complexity of Guided Berry Phase Estimation
We prove that deciding the Berry phase for parameterised 2-local qubit Hamiltonians is BQP-complete when presented with a classical description of a guiding state, promised to overlap with the…Strong Selective and List-Decoding Direct Product Theorems for Quantum Query Complexity
Quantum strong direct-product theorems for specific functions have been known for nearly two decades.