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
Graph TheoryMarkov ChainProbability·Captain: Shuze Chen

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local UniformityResearch Paper

Counting the proper kkk-colorings of a graph approximately, and sampling one nearly uniformly, are equivalent problems, and both are classical test cases for Markov chain Monte Carlo. The simplest sampler is the Glauber dynamics, which recolors one vertex at a time. Jerrum (Jer95) showed that it mixes in O(nlog⁡n)O(n\log n)O(nlogn) steps whenever k>2Δk>2\Deltak>2Δ, where Δ\DeltaΔ is…

24 thms2 active usersReviewed
Graph TheoryInformation TheoryProbability·Captain: Shuze Chen

Space-Optimal Algorithms for Spanning Forests in Dynamic Streams at Every Confidence Level: With and Without Deletion ConstraintsResearch Paper

Connected components underlie single-linkage clustering, record linkage and many graph analyses. When a graph is too large to store and its edges arrive as insertions and deletions, one asks for a compact summary from which a spanning forest can be recovered: one tree spanning each connected component, built from edges currently present. A forest on vvv vertic…

22 thms2 active usersReviewed
Operations ResearchOptimizationProbability·Captain: Shuze Chen

Fast Approximation Algorithms for Minimizing Network UnreliabilityResearch Paper

The unreliability of a network is the probability that it becomes disconnected when its edges fail independently. Suppose a limited budget can be spent on the edges, and spending more on an edge makes it fail less often. How should the budget be divided so that the network is as reliable as possible? Chakrabarty, Mehta and Vazirani raised this question and…

19 thms2 active usersReviewed
Algorithmic Game TheoryComputational ComplexityLinear algebra·Captain: Shuze Chen

Finding a Positive Index Nash Equilibrium is PPADS-CompleteResearch Paper

Every finite game has a Nash equilibrium, but equilibria are not all alike. In a nondegenerate two-player game, each equilibrium carries a Shapley index of +1+1+1 or −1-1−1, a local orientation that sums to +1+1+1 over all equilibria. The index is an established selection criterion: an isolated equilibrium is sustainable exactly when it has index +1+1+1 (Govindan et al.,…

38 thms2 active usersReviewed
Graph TheoryOperations ResearchOptimization·Captain: Shuze Chen

Improved Steiner Forest Approximation via Cut SpacesResearch Paper

Steiner Forest is the basic problem of buying connections in a network. A network has nonnegative edge costs, and a list of vertex pairs must each be joined by a path; an edge is paid for once, however many paths use it. Shortest paths and Steiner trees are special cases. The problem is NP-hard, so the question is the best approximation factor: a bound rrr suc…

16 thms2 active usersReviewed
CombinatoricsComputational ComplexityGraph Theory·Captain: Shuze Chen

Sounder, shorter, and simpler PCPs from HDX neighborhoodsResearch Paper

A two-query probabilistically checkable proof (PCP) lets a verifier check membership in an NP language by reading two symbols of a proof. Its three parameters are the soundness error ε\varepsilonε (the largest acceptance probability on a false claim), the proof length and the alphabet size. Two-query PCPs with small soundness are the starting point of most…

18 thms2 active usersReviewed
AlgebraComputational ComplexityLinear algebra·Captain: Shuze Chen

Partial Homogenization and the Structure of Optimal Algebraic AlgorithmsResearch Paper

A quadratic map ϕ=(ϕ1,…,ϕK)\phi=(\phi_1,\dots,\phi_K)ϕ=(ϕ1​,…,ϕK​) is a tuple of quadratic forms in variables z=(z1,…,zN)z=(z_1,\dots,z_N)z=(z1​,…,zN​). Polynomial multiplication, matrix multiplication and multiplication in an algebra such as C\mathbb CC over R\mathbb RR are all quadratic maps. Algebraic complexity theory measures how many multiplications such a map needs, and the classical count is the…

15 thms2 active usersReviewed
Combinatorics·Captain: Shuze Chen

Constant-Time Inverse Suffix Array Queries in Compact Space and Sublinear-Time Construction of Suffix Array IndexesResearch Paper

The suffix array SAT\mathrm{SA}_TSAT​ of a text T∈[0..σ)nT \in [0..\sigma)^nT∈[0..σ)n lists the starting positions of the suffixes of TTT in lexicographic order. Its inverse, the inverse suffix array SAT−1\mathrm{SA}^{-1}_TSAT−1​, maps a position jjj to the lexicographic rank of the suffix T[j..n]T[j..n]T[j..n]. Both arrays are central to text indexing, data compression and string algorithms. Stored…

20 thms2 active usersReviewed
CombinatoricsFunctional AnalysisRandom Matrix Theory·Captain: Shuze Chen

A Walk from Free Probability to Matrix Discrepancy II: Weaver's Problem and the Kadison-Singer ProblemResearch Paper

Let v1,…,vn∈Cmv_1,\dots,v_n\in\mathbb C^mv1​,…,vn​∈Cm satisfy ∑ivivi∗=Im\sum_i v_iv_i^*=I_m∑i​vi​vi∗​=Im​ and ∥vi∥2≤ε\|v_i\|^2\le\varepsilon∥vi​∥2≤ε for every iii. Weaver's discrepancy problem asks for signs σ∈{−1,1}n\sigma\in\{-1,1\}^nσ∈{−1,1}n for which the operator norm ∥∑iσivivi∗∥\|\sum_i\sigma_iv_iv_i^*\|∥∑i​σi​vi​vi∗​∥ is small, equivalently a partition of the vectors into two sets whose frame operators are both close to Im/2I_m/2Im​/2. Weaver (Wea04) showed that a…

22 thms2 active usersReviewed
CombinatoricsOperations ResearchProbability·Captain: Shuze Chen

Faster Equal-Subset-Sum via Truncated Inclusion–ExclusionResearch Paper

Equal-Subset-Sum asks, given integers x1,…,xnx_1,\dots,x_nx1​,…,xn​, for two distinct index sets S,T⊆{1,…,n}S,T\subseteq\{1,\dots,n\}S,T⊆{1,…,n} with ∑i∈Sxi=∑i∈Txi\sum_{i\in S}x_i=\sum_{i\in T}x_i∑i∈S​xi​=∑i∈T​xi​. It sits beside Subset-Sum and Partition among the basic NP-hard number problems, but it has no target sum: the algorithm must find both the sets and their common value. Its worst-case exponential running time has…

19 thms2 active usersReviewed
Machine LearningProbabilityStatistics·Captain: Shuze Chen

Understanding Model Misspecification in Low-Rank Distributions: Tolerant Testing and Agnostic LearningResearch Paper

Sequence models such as hidden Markov models, tensor trains and autoregressive language models define laws on strings of length TTT over a finite alphabet. A common measure of their complexity is the distribution rank: the largest rank of the matrices that pair every history with every future. Low-rank laws can be learned efficiently from conditional samples…

20 thms2 active usersReviewed
cryptographyLinear algebraProbability·Captain: Shuze Chen

Leakage-Resilient Computation via Matrix RefreshingResearch Paper

Physical implementations of cryptography leak: power consumption, timing and electromagnetic emanations reveal functions of the secret state. Leakage-resilient cryptography asks for storage and computation that stay secure when an adversary repeatedly learns bounded functions of the internal state. In the split-state (or only computation leaks) model the…

21 thms2 active usersReviewed
CombinatoricsMachine LearningProbability·Captain: Shuze Chen

The Margin Complexity of Maxima of Linear FunctionalsResearch Paper

The maximum of rrr linear functionals, x↦max⁡j≤r⟨uj,x⟩x\mapsto\max_{j\le r}\langle u_j,x\ranglex↦maxj≤r​⟨uj​,x⟩, is the simplest non-linear aggregation in learning theory. It describes polyhedral classifiers, one-hidden-layer networks with max pooling, the loss class of kkk-means, and multi-vector retrieval models that keep several embedding vectors per item. Its statistical complexity at a…

25 thms2 active usersReviewed
Complexity TheorycryptographyInformation Theory·Captain: Shuze Chen

Quadratic Statistical Randomized Encoding for All FunctionsResearch Paper

A randomized encoding of a function fff replaces fff by a randomized function f^(v;r)\hat f(v;r)f^​(v;r) whose output reveals f(v)f(v)f(v) and nothing else about vvv. Encodings are useful when f^\hat ff^​ is much simpler to compute than fff. They underlie parallel cryptography (one-way functions, pseudorandom generators and encryption computable in constant output locality), and they are the…

29 thms2 active usersReviewed
CombinatoricsComputational ComplexityLogic·Captain: Shuze Chen

Polynomial Interpolation for Sherali-Adams Lower BoundsResearch Paper

Sherali-Adams is the standard proof system for refuting unsatisfiable CNF formulas with linear programming. Its refutations are linear-programming certificates over products of literals, the same objects that underlie the Sherali-Adams hierarchy of LP relaxations (Sherali–Adams 1990). It polynomially simulates Resolution, the proof system whose lines are…

23 thms2 active usersReviewed
Computational ComplexityGroup Theory·Captain: Shuze Chen

Word Length and Diameter in Permutation GroupsResearch Paper

A finite group GGG generated by a set Σ\SigmaΣ raises a basic quantitative question: how many generators must be multiplied to reach a given element? The answer is measured by the length ℓ(g,Σ)\ell(g,\Sigma)ℓ(g,Σ) of an element and the diameter diam⁡(G,Σ)\operatorname{diam}(G,\Sigma)diam(G,Σ) of the group. Geometrically they are distances in the directed Cayley graph of GGG, and they appear in…

25 thms2 active usersReviewed
CombinatoricsGraph TheoryProbability·Captain: Shuze Chen

Optimal (Randomized) Compact Routing SchemesResearch Paper

A routing scheme delivers messages in a network in which every vertex forwards a message using only the information it stores. Storing a full shortest-path table at every vertex costs Θ(n)\Theta(n)Θ(n) words per vertex, which is too much for large networks, so compact routing trades storage for longer routes. The trade-off has been studied since the late 1980s:…

21 thms2 active usersReviewed
Complexity Theory·Captain: Secousses

Integer multiplication: κ = 0.00363797977 (community PR #7113, conditional construction)Open Problem

Multiplying two binary integers is a basic task in computational complexity. The relevant resource here is the number of individual steps made by a machine whose tapes can only be accessed through moving heads. Harvey and van der Hoeven established an O(nlog⁡n)O(n\log n)O(nlogn) bound in this model. The OpenAI manuscript proposes a positive saving in the exponent of the…

2 thms2 active usersReviewed
CombinatoricsComplexity Theory·Captain: iris

Accepting Subcubes and the Approximability of Complete Boolean Min-CSPsResearch Paper

In a minimum constraint satisfaction problem (Min-CSP) the input is a set of Boolean variables and a list of constraints, and the goal is an assignment violating as few constraints as possible. On general instances, Min-2-CNF Deletion has an O(log⁡n)O(\sqrt{\log n})O(logn​)-approximation, while a constant factor would refute the Unique Games Conjecture; for Min-3-SAT any…

40 thms2 active usersReviewed
AlgebraComputational Complexity·Captain: iris

A Circuit Complexity Trichotomy For Regular LanguagesResearch Paper

Unbounded fan-in Boolean circuits are the standard model of parallel computation, and finite automata the standard model of sequential computation with constant memory. Regular languages sit where the two meet: they separate AC0\mathsf{AC}^0AC0 from NC1\mathsf{NC}^1NC1 (Furst, Saxe, Sipser 1984), any separation of ACC0\mathsf{ACC}^0ACC0 or TC0\mathsf{TC}^0TC0 from NC1\mathsf{NC}^1NC1 is…

51 thms2 active usersReviewed
CombinatoricsConvex OptimizationProbability·Captain: Shuze Chen

Subexponential Approximation of the Permanent in Deterministic Polynomial TimeResearch Paper

The permanent of an n×nn\times nn×n matrix AAA is

23 thms2 active usersReviewed
Functional AnalysisQuantum InformationRandom Matrix Theory·Captain: mikedeng1

Quantum Advantage for Distributed Symmetry BreakingResearch Paper

In distributed computing, symmetry breaking asks the nodes of a network, all running the same program, to produce locally different outputs; the basic example is a proper colouring of a cycle. In the classical LOCAL model, 3-colouring an nnn-cycle requires Θ(log⁡∗n)\Theta(\log^* n)Θ(log∗n) communication rounds, with or without randomness (Linial 1992). Whether quantum…

30 thms2 active usersReviewed
CombinatoricsProbability·Captain: mikedeng1

A Near-Optimal Parallel Algorithm for Finding Matroid BasesResearch Paper

A matroid M=(E,I)M=(E,\mathcal I)M=(E,I) on a finite ground set EEE of nnn elements is a family I\mathcal II of independent sets that contains ∅\emptyset∅, is closed under taking subsets, and satisfies the exchange property. Spanning forests of graphs and bases of vector configurations are the standard examples. A basis is a maximal independent set. Because the number of…

27 thms2 active usersReviewed
Graph TheoryProbability·Captain: mikedeng1

Settling the Query Complexity of Weighted Stochastic MatchingResearch Paper

A matching pairs vertices using edges that share no endpoint. When the edges describe uncertain compatibility, finding a good pairing requires tests: an edge can be used only after learning that it is present. In the non-adaptive query model, all tests must be selected before their outcomes are observed. The motivating kidney-exchange interpretation makes…

36 thms2 active usersReviewed
Computational ComplexityProbabilityQuantum Information·Captain: mikedeng1

Quantum Query Lower Bounds from Classical Moment MatchingResearch Paper

Many properties studied in property testing and distribution estimation are symmetric: they depend on a function f:[N]→[N]f:[N]\to[N]f:[N]→[N] only through how often each output value occurs. Examples are the number of distinct values (support size), element distinctness, collision-freeness, and kkk-distinctness. A standard way to prove classical query lower bounds for such…

20 thms2 active usersReviewed
PreviousPage 17 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