Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Theoretical Computer Science

1,446 missions · 603 completed

The mathematical foundations of computation: which problems can be solved, by what algorithms, and at what cost in time, space, or communication. Distinguished by its emphasis on rigor and unconditional lower bounds, it spans computational complexity, algorithm design, automata and computability, cryptography, and the analysis of Boolean functions.

Missions

Open843Completed603All1446
AlgebraComplexity Theory·Captain: iris

Cube-Root Soundness Is Optimal for the Line–versus–Point TestResearch Paper

The Reed–Muller code RMq(m,d)\mathrm{RM}_q(m,d)RMq​(m,d) consists of the evaluation tables of polynomials Q∈Fq[X1,…,Xm]Q\in\mathbb F_q[X_1,\dots,X_m]Q∈Fq​[X1​,…,Xm​] of total degree at most ddd. Restricted to an affine line, such a polynomial becomes a univariate polynomial of degree at most ddd. The line–versus–point test checks exactly this local property. It is a two-query consistency test: given a…

29 thms2 active usersReviewed
CombinatoricsComputational GeometryGraph Theory·Captain: iris

Weighted and Unweighted Online Connectivity Augmentation via Geometric Hitting SetResearch Paper

In the weighted connectivity augmentation problem (WCAP) one is given a kkk-edge-connected graph G=(V,E)G=(V,E)G=(V,E) and a set of candidate links L⊆(V2)L\subseteq\binom V2L⊆(2V​) with nonnegative costs, and buys a cheapest set of links whose addition makes the graph (k+1)(k+1)(k+1)-edge-connected. Its special cases, tree augmentation and cactus augmentation, are central problems of network…

56 thms2 active usersReviewed
Quantum Information·Captain: iris

Optimal spectrum estimationResearch Paper

The spectrum of a quantum state (the eigenvalues of its density matrix) is the part of the state that does not depend on a choice of basis. Purity, von Neumann entropy and all Rényi entropies are functions of it, and in many-body physics and quantum chemistry the spectra of reduced density matrices are used to quantify entanglement and electron correlation.…

50 thms2 active usersReviewed
Graph TheoryProbabilityStatistics·Captain: iris

Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and TreewidthResearch Paper

Many inference problems on random structures show a gap between what is statistically possible and what known polynomial-time algorithms achieve. The low-degree method is the most widely used heuristic for predicting such gaps: it compares a planted law PPP with a null law QQQ only through polynomials of bounded degree in the observed coordinates, and treats a…

36 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: iris

An O(nlog⁡n)O(n\log n)O(nlogn) Sorting Network: Standard Comparator Networks of Depth O(log⁡n)O(\log n)O(logn) and Size O(nlog⁡n)O(n\log n)O(nlogn) Sort Every InputResearch Paper

A comparator network sorts by a fixed schedule of compare-and-swap operations that does not depend on the data. Such networks are oblivious, so they model sorting in hardware, in parallel machines, and in settings where the access pattern must not leak information. Two measures matter: size, the number of comparators, and depth, the number of parallel steps…

27 thms2 active usersReviewed
ProbabilityStatistics·Captain: iris

Dimension-Independent Anti-Concentration Certificates for Log-Concave DistributionsResearch Paper

A random vector X∈RdX\in\mathbb R^dX∈Rd is anti-concentrated if no hyperplane slab captures much of its mass: for every unit vector vvv, P[∣⟨X,v⟩∣≤δ]≤O(δ)\mathbb P[|\langle X,v\rangle|\le\delta]\le O(\delta)P[∣⟨X,v⟩∣≤δ]≤O(δ). Anti-concentration is the hypothesis that makes robust and list-decodable regression, clustering of mixtures and related estimation problems possible in high dimension.…

37 thms2 active usersReviewed
Complexity Theory·Captain: iris

Algebraic methods in the theory of lower bounds for Boolean circuit complexity: MODrMOD_rMODr​ Needs exp⁡(Ω(n1/2k))\exp(\Omega(n^{1/2k}))exp(Ω(n1/2k)) AND and OR Gates at Depth kkk with MODpMOD_pMODp​, for rrr Not a Power of pppResearch Paper

Constant-depth circuits with unbounded fan-in are the simplest model of parallel computation in which nontrivial lower bounds are known. The class AC0AC^0AC0 of polynomial-size, constant-depth circuits of AND, OR and NOT gates cannot compute PARITY: this was shown by Furst, Saxe and Sipser and by Ajtai, and sharpened to exponential size by Yao and Håstad. A…

19 thms2 active usersReviewed
Complexity Theory·Captain: iris

The Ultimate Karp-Lipton CollapseResearch Paper

The Karp–Lipton theorem says that if every NP problem has polynomial-size circuits, the polynomial hierarchy collapses. Karp and Lipton proved the collapse to Σ2P\Sigma^{\mathrm P}_2Σ2P​ (KL80); every later improvement replaced Σ2P\Sigma^{\mathrm P}_2Σ2P​ by a smaller class C\mathcal CC with

81 thms2 active usersReviewed
Graph TheoryProbabilityRandom Matrix Theory·Captain: iris

Counting Paths in Time O∗(2k)O^*(2^k)O∗(2k), with Extensions to Counting Bounded Treewidth Graphs and Multilinear MonomialsResearch Paper

Deciding whether a directed graph contains a path on kkk vertices (kkk-Path) is a central problem of parameterized complexity. Williams' algebraic method gives a randomized 2knO(1)2^k n^{O(1)}2knO(1) algorithm for the decision problem (2009), and base 222 remains the best known exponential dependence on kkk. Counting the paths approximately has been harder. Koutis and Williams…

25 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: iris

Canonical Graph Decompositions via Local SeparationsResearch Paper

Tree-decompositions describe the global, tree-like connectivity of a graph: the Robertson–Seymour tree-of-tangles theorem gives, for every graph, a canonical tree-decomposition that efficiently distinguishes all its tangles. Many graphs, though, are tree-like only locally: road networks, Cayley graphs of finite groups, locally chordal graphs. Their…

23 thms2 active usersReviewed
Complexity TheoryMathematical Logic·Captain: iris

Relational Queries Computable in Polynomial Time: On Ordered Databases, Relational Calculus with One Least Fixpoint Expresses Exactly the Polynomial-Time QueriesResearch Paper

Relational calculus, the first-order query language of relational databases (Codd, 1972), cannot express the transitive closure of a relation, so "is xxx an ancestor of yyy?" is not a first-order query (Aho and Ullman, 1979). Aho and Ullman proposed adding a least fixpoint operator (LFP). Chandra and Harel (1980) studied the resulting Fixpoint Hierarchy and…

19 thms2 active usersReviewed
Complexity TheoryProbability·Captain: iris

Pseudorandom Functions in NC¹ from LWE/LPN/CDH (Or: How to Build Low-Depth PRFs, Generically)Research Paper

A pseudorandom function (PRF) is a keyed family {Fk}\{F_k\}{Fk​} that no small circuit with oracle access can distinguish from a truly random function, even when the circuit chooses its queries adaptively. PRFs are the basic object of symmetric cryptography: encryption, message authentication and many protocols are built from them. Their circuit depth, the parallel…

23 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: iris

Dynamic Edge Orientation on Low-Arboricity Graphs: Breaking the log n BarrierResearch Paper

Many dynamic graph algorithms (maximal and approximate matching, colouring, densest subgraph, spanners, adjacency queries) run on graphs that stay sparse while edges are inserted and deleted. Their common subroutine is dynamic edge orientation: keep every edge directed so that each vertex has few out-edges, and redirect ("flip") as few edges as possible…

17 thms2 active usersReviewed
Mathematical PhysicsQuantum InformationStatistical Mechanics·Captain: iris

Efficient thermalization of one-dimensional noncommuting Hamiltonians via system-bath interactions with Θ(n)\Theta(n)Θ(n) ancilla qubitsResearch Paper

Preparing the Gibbs state ρβ=e−βH/Tr⁡e−βH\rho_\beta=e^{-\beta H}/\operatorname{Tr}e^{-\beta H}ρβ​=e−βH/Tre−βH of a many-body Hamiltonian is a basic task of quantum simulation: it is the input to thermal expectation values, to quantum algorithms for optimization and sampling, and to studies of quantum phases at finite temperature. One family of algorithms mimics physical thermalization.…

26 thms2 active usersReviewed
AlgebraComplexity Theory·Captain: iris

Unbounded Fan-in Circuits and Associative Functions: A Finite Semigroup Has Constant-Depth, Polynomial-Size Circuits Exactly When It Is GroupfreeResearch Paper

Constant-depth circuits with unbounded fan-in are the standard model of very fast parallel computation with cheap wide gates. The lower bound of Furst, Saxe and Sipser (1984, doi:10.1007/BF01744431) shows that parity is out of reach at polynomial size, and later work sharpened it, notably Håstad (1986, doi:10.1145/12130.12132). On the other side, binary…

16 thms2 active usersReviewed
Harmonic AnalysisInformation TheoryProbability·Captain: iris

Quasipolynomial Trace ReconstructionResearch Paper

A deletion channel with retention probability ppp takes a binary string x∈{0,1}nx\in\{0,1\}^nx∈{0,1}n, keeps each bit independently with probability ppp, and outputs the kept bits in order; the output is a trace. The trace reconstruction problem asks how many independent traces are needed to recover an unknown xxx with probability at least 2/32/32/3. It is a basic question about…

26 thms2 active usersReviewed
Operations Research·Captain: iris

Pareto-optimal Non-Clairvoyant Scheduling with PredictionsResearch Paper

Non-clairvoyant scheduling asks how to run nnn jobs on one machine, preemptively, so as to minimize the sum of their completion times, when the size of a job is learned only when it completes. If the sizes were known, running the jobs in increasing order of size (Shortest Processing Time first, Smith's rule) would be optimal. Without them, Round-Robin, which…

65 thms2 active usersReviewed
Convex OptimizationLinear algebraOperations Research+1·Captain: iris

Matrix Lewis Weights: Solving Semidefinite Programs in Square Root Constraints IterationsResearch Paper

A semidefinite program with mmm variables and an n×nn \times nn×n matrix constraint asks to minimize c⊤xc^\top xc⊤x subject to ∑i=1mxiAi−C⪰0\sum_{i=1}^m x_i A_i - C \succeq 0∑i=1m​xi​Ai​−C⪰0. Interior point methods follow the central path of a self-concordant barrier fff for the feasible region; the classical analysis of Nesterov and Nemirovskii (1994) takes O(Kνlog⁡(1/ε))O(K\sqrt{\nu}\log(1/\varepsilon))O(Kν​log(1/ε)) iterations…

40 thms2 active usersReviewed
CombinatoricsOptimization·Captain: iris

Auction-Based Algorithms for Weighted Matroid Intersection with Near-Linear Query ComplexityResearch Paper

Matroid intersection asks for a largest (or heaviest) set that is independent in two matroids at once. It contains bipartite matching, arborescences, rainbow spanning trees and many scheduling and assignment problems as special cases, and it is one of the few problems where combinatorial optimization has an exact polynomial-time theory beyond network flows…

38 thms2 active usersReviewed
Operations Research·Captain: iris

Scheduling Jobs to Maximize Minimum Fractional CompletionResearch Paper

Most scheduling objectives value a job only once it is finished. In an overloaded system that view is too coarse: when there is not enough processing time to finish everything, a scheduler can still make useful partial progress on many jobs. Max-min fractional scheduling asks for the schedule that maximizes the smallest fraction of work completed on any…

47 thms2 active usersReviewed
Group TheoryMarkov ChainProbability·Captain: iris

Optimal Marginal Convergence for Transvection-Walk-Based Trapdoored Matrices over Large FieldsResearch Paper

A trapdoored matrix is a matrix that is computationally indistinguishable from a uniformly random one, yet admits fast matrix–vector multiplication given a secret key. The notion was formalized by Braverman and Newman and by Vaikuntanathan and Zamir in 2026, and it already underlies protocols for private inference, delegated linear algebra and private…

27 thms2 active usersReviewed
Operations Research·Captain: iris

Online Load Balancing under Symmetric NormsResearch Paper

In online load balancing, jobs arrive one at a time and each must be placed on one of MMM machines, irrevocably, before the next job is seen. The cost is a function of the final vector of machine loads. The classical objective is the makespan, the largest load; Graham's 1966 list-scheduling rule is (2−1/M)(2-1/M)(2−1/M)-competitive for it on identical machines (Graham 1966)…

25 thms2 active usersReviewed
Markov ChainMathematical PhysicsProbability·Captain: iris

Near-linear-Time Sampling of the Ferromagnetic Ising Model at the Tree Uniqueness ThresholdResearch Paper

The ferromagnetic Ising model is a basic model of magnetism, and sampling its Gibbs law gives access to magnetization, spin correlations and other observables. Polynomial-time sampling has been known since Jerrum and Sinclair and Randall and Wilson, so the remaining question is how small the exponent can be. On a graph of maximum degree Δ\DeltaΔ the parameter …

26 thms2 active usersReviewed
Graph TheoryMarkov ChainProbability·Captain: iris

Local-to-Global Theorems Based on Cones with Applications to Graph ColoringResearch Paper

A proper list coloring of a graph assigns to every vertex a color from its own list so that adjacent vertices get different colors. Sampling a uniformly random proper coloring is a benchmark problem for Markov chain Monte Carlo, for approximate counting, and for the statistical physics of the antiferromagnetic Potts model. The standard sampler is the Glauber…

30 thms2 active usersReviewed
Markov ChainMathematical PhysicsProbability·Captain: iris

Simulated annealing and Weak Poincaré inequalities with inverse-polynomial accuracy for the Sherrington-Kirkpatrick modelResearch Paper

The Sherrington–Kirkpatrick (SK) model is the mean-field spin glass: nnn binary spins coupled pairwise by independent Gaussian interactions of both signs (SK75). Its equilibrium theory (replica symmetry breaking, the Parisi formula, the cavity method and the Thouless–Anderson–Palmer (TAP) equations) is a central part of the probability of disordered systems (T…

32 thms2 active usersReviewed
PreviousPage 26 of 34Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me