Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

ACM STOC 2027

Formalizations of theorems from papers submitted to ACM STOC 2027 (the 59th Annual ACM Symposium on Theory of Computing). Paper list: https://sigact-stoc.github.io/stoc2027/ . Missions here state a main result of a STOC 2027 paper in Lean 4 with Mathlib; each mission's title begins with the paper title.

1499 missions

Missions

901–925 of 1499
Open1321Completed178All1499
🏆Completed
cryptographyProbabilityTheoretical Computer Science·Captain: iris

Correlated Group Actions: Founding Cryptography on S4 and SnResearch Paper

Oblivious transfer (OT) is a two-party primitive in which a sender holds two bits m0,m1m_0, m_1m0​,m1​, a receiver holds a selection bit sss, and the receiver learns msm_sms​ while the sender learns nothing about sss and the receiver learns nothing about the other bit m1−sm_{1-s}m1−s​. Kilian showed in 1988 that OT is complete for secure two-party computation: any function can be…

15 thms2 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: Shuze Chen

Beyond Width-3: Better Hitting Set Generators for Width-4 Read-Once Branching ProgramsResearch Paper

A computation with little working memory can still use many random bits. A read-once branching program records how its memory state changes as these bits arrive. Its width measures the number of possible states at each step, and its length counts the bits read. Finding short deterministic descriptions of useful input strings is one way to understand how…

27 thms2 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: Shuze Chen

Fully Dynamic Correlation Clustering with Vertex Updates in Polylogarithmic Update TimeResearch Paper

Correlation clustering asks for a partition of the vertices of a complete graph whose edges are labelled (+)(+)(+) (similar) or (−)(-)(−) (dissimilar), minimizing the number of disagreements: (+)(+)(+) edges between clusters plus (−)(-)(−) edges inside clusters. Introduced by Bansal, Blum and Chawla (DOI 10.1023/B:MACH.0000033116.57574.95), it is a standard model for…

22 thms2 active usersReviewed
CombinatoricsGraph TheoryOperations Research+1·Captain: iris

Breaking the O(mn)O(mn)O(mn) Barrier for Minimum Bipartite Dijoin via Dynamic and Local Graph AlgorithmsResearch Paper

A dijoin of a digraph is a set of arcs whose contraction makes the digraph strongly connected; equivalently, a set of arcs meeting every dicut, the nonempty set of arcs crossing a vertex bipartition when all crossing arcs point the same way. Lucchesi and Younger proved in 1978 that the minimum size of a dijoin equals the maximum number of pairwise…

30 thms2 active usersReviewed
Functional AnalysisLinear algebraMarkov Chain·Captain: iris

Recursive Operator Localization and Spectral Gap Descent via the Geometry of Local Spectral ExpansionResearch Paper

Lower bounds on spectral gaps control the directions outside the kernel of a positive operator: the gap of a Hamiltonian above its ground-state energy, or the gap of a reversible Markov generator above its stationary subspace. For large systems such bounds are hard to obtain directly. Local-to-global methods combine tractable local estimates with control of…

34 thms2 active usersReviewed
CombinatoricsComplexity TheoryOperations Research+1·Captain: Shuze Chen

The Movement Complexity of SortingResearch Paper

The comparison model counts comparisons and gives sorting its classical Θ(nlog⁡n)\Theta(n\log n)Θ(nlogn). On many machines that is not the whole cost: before two keys can be compared they must be brought within reach of the machine's read heads, and the heads travel. Head travel is already known to dominate in sequential models — on a Turing machine with one worktape and a…

24 thms2 active usersReviewed
Computational ComplexityProbabilityTheoretical Computer Science·Captain: Shuze Chen

Exact Parallel Sampling without Maximal Independent SetsResearch Paper

A counting oracle for a distribution μ\muμ on [q]n[q]^n[q]n answers a query (S,y)(S,y)(S,y) with the marginal probability Pr⁡X∼μ[XS=y]\Pr_{X\sim\mu}[X_S=y]PrX∼μ​[XS​=y]. Any-order autoregressive and masked diffusion models provide exactly this access. With it, μ\muμ can be sampled coordinate by coordinate, but that takes nnn sequential rounds. The question of parallel sampling is how many adaptive rounds…

23 thms2 active usersReviewed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: Shuze Chen

Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with kkk-SUM in 2DResearch Paper

In ddd-Knapsack (the vector or multidimensional knapsack problem) every item has a profit and a ddd-dimensional weight vector, and one must choose a set of items of maximum total profit whose total weight stays within a capacity in every coordinate. It models any selection problem with several budgets at once (money, time, space, staff) and is the simplest…

21 thms2 active usersReviewed
Complexity TheoryInformation TheoryProbability+1·Captain: Shuze Chen

Tight Bounds for Rank Estimation in Turnstile StreamsResearch Paper

A rank query asks how much of a dataset lies below a threshold; together with its inverse, the select (quantile) query, it summarizes the empirical distribution of the data: medians, percentiles, tail behaviour, and selectivity estimates for database queries. When the data change through insertions and deletions (database records removed, network sessions…

24 thms2 active usersReviewed
Graph TheoryTheoretical Computer Science·Captain: Shuze Chen

Local Distributed Computation under Crash FailuresResearch Paper

In the LOCAL model of distributed computing, every node of a communication graph runs the same deterministic program, rounds are synchronous, messages are unbounded, and a problem's complexity is the number of rounds after which every node can produce its output. Without failures, a node learns its whole radius-RRR neighborhood in RRR rounds, so any TTT-round…

20 thms2 active usersReviewed
CombinatoricsComplexity TheoryGraph Theory+1·Captain: Shuze Chen

Exact Counting and Sampling of Labeled Graphs of Bounded Treewidth with MSO PropertiesResearch Paper

Treewidth measures how closely a graph resembles a tree. Graphs of treewidth at most kkk have tree decompositions computable in linear time for fixed kkk (Bodlaender 1996), and Courcelle's theorem decides every fixed monadic second-order property on such graphs in linear time (Courcelle 1990; Arnborg, Lagergren and Seese 1991). These results analyze a given grap…

24 thms2 active usersReviewed
Algebraic GeometryComputational ComplexityNumber Theory·Captain: Shuze Chen

Deterministic Root-Finding over Finite Fields with Elliptic CurvesResearch Paper

Let Fq\mathbb F_qFq​ be a finite field with q=peq = p^eq=pe elements. Root-finding asks, given a polynomial f∈Fq[X]f \in \mathbb F_q[X]f∈Fq​[X] that is split (a product of linear factors) and separable (coprime with its derivative), for the set of its roots in Fq\mathbb F_qFq​. Factoring arbitrary polynomials over Fq\mathbb F_qFq​ reduces to this problem in deterministic polynomial time (Berleka…

12 thms2 active usersReviewed
Algorithmic Game TheoryComplexity TheoryOperations Research·Captain: Shuze Chen

A Strongly Polynomial-Time 7/9-Approximation Algorithm for Maximin Share AllocationsResearch Paper

Dividing indivisible goods fairly among agents with additive valuations is a central problem of fair division. Proportionality and envy-freeness can fail for indivisible goods, so the standard benchmark is the maximin share (MMS), introduced by Budish (Budish 2011): the largest value an agent can guarantee by splitting all goods into as many bundles as…

13 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: mikedeng1

Improved Bounds on Distance PreserversResearch Paper

A distance preserver is a sparse subgraph that keeps a prescribed set of distances exact. Distance preservers were introduced by Coppersmith and Elkin as a basic object of graph sparsification and compression, and they appear inside constructions of additive spanners, distance oracles, hopsets and shortcut sets. The central extremal question is how many…

38 thms2 active usersReviewed
Graph Theory·Captain: mikedeng1

Partially Dynamic Single-Source Shortest Paths in Almost-Linear TimeResearch Paper

A decremental shortest-path data structure receives a directed graph and a fixed source, then answers distance queries while edges disappear. A deletion can invalidate shortest paths to many vertices at once. Recomputing all distances after every deletion is therefore a useful baseline, but its total work can be much larger than the initial graph. The…

60 thms2 active usersReviewed
CombinatoricsGraph TheoryProbability·Captain: mikedeng1

Adaptive Sparsifier Revisited: (1±ϵ)(1 \pm \epsilon)(1±ϵ)-Approximate, Fast, and SimpleResearch Paper

A spectral sparsifier replaces a graph by a smaller reweighted subgraph while approximately preserving the energy of every real vector on its vertices. This allows graph algorithms to use a smaller representation without losing the quadratic quantities they need. The source identifies Laplacian systems, random walks, and flow algorithms as applications. In…

20 thms2 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: mikedeng1

An Explicit and Optimal Separation of BPP from NP in Number-on-Forehead Communication ComplexityResearch Paper

Communication complexity measures how many bits participants must exchange when each sees only part of an input. In the number-on-forehead model, there are kkk participants and kkk input blocks: participant iii sees every block except block iii. Their overlapping knowledge makes lower bounds difficult. A separation between randomness and nondeterminism asks whether…

13 thms2 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: mikedeng1

The Local Probe Complexity of Maximal Independent SetResearch Paper

A maximal independent set in a graph is a collection of vertices with no edge between two chosen vertices, such that every unchosen vertex has a chosen neighbor. A local computation algorithm answers whether a queried vertex belongs to one fixed solution while inspecting only part of the graph. Different queries must agree with that solution even though…

22 thms2 active usersReviewed
Group TheoryQuantum InformationRepresentation Theory·Captain: iris

Depth-111 expanders on the unitary group and applicationsResearch Paper

A quantum expander is a small set of unitaries U1,…,UmU_1,\dots,U_mU1​,…,Um​ on a ddd-dimensional space whose average X↦1m∑iUiXUi†X\mapsto \frac1m\sum_i U_iXU_i^\daggerX↦m1​∑i​Ui​XUi†​ shrinks every traceless matrix by a constant factor. Quantum expanders were introduced to build short quantum one-time pads (Ambainis–Smith 2004), to prove that the quantum entropy-difference problem is QSZK-complete,…

45 thms2 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: iris

Near-Optimal Compressed Algorithms and Data Structures by Eliminating Recursive SubstructuresResearch Paper

A rank query on a string TTT asks how many times a symbol ccc occurs among the first iii symbols of TTT. Rank queries are a basic primitive of compressed text indexes (FM-index, wavelet trees), and on an uncompressed text over an integer alphabet they are answered in near-constant time after linear preprocessing. Compressed indexing asks for the same queries when TTT…

24 thms2 active usersReviewed
AnalysisFunctional AnalysisProbability·Captain: iris

An O(1)O(1)O(1) Bound for the KLS ConstantResearch Paper

The Kannan–Lovász–Simonovits (KLS) conjecture (Kannan, Lovász, Simonovits, 1995) asks whether isotropic log-concave probability measures satisfy an isoperimetric inequality with a constant independent of the dimension: up to a universal factor, halfspaces should be the sets with the smallest boundary relative to their measure. The conjecture sits at the…

19 thms2 active usersReviewed
Graph TheoryLinear algebraTheoretical Computer Science·Captain: iris

Revisiting Local Push: Faster Algorithms and Optimal Query Complexity for PageRank and Effective ResistanceResearch Paper

Personalized PageRank from a seed node is the basic primitive of local graph algorithms: it drives local clustering by sweep cuts (Andersen, Chung, Lang 2007; Andersen, Chung 2007) and the bidirectional estimation of single PageRank values (Lofgren, Banerjee, Goel 2015). The standard local method is the push of Andersen, Chung and Lang. It computes an…

29 thms2 active usersReviewed
AlgebraComplexity TheoryQuantum Information·Captain: iris

Optimal Quantum Query Bounds for Identifying Classes of 333-TensorsResearch Paper

Identifying an unknown function from a known class by querying it is the exact-learning or interpolation problem, and for polynomials over a finite field it is the query side of black-box identity testing. By counting, no classical algorithm, even a randomized one, identifies a member of a class C\mathcal CC of functions over Fq\mathbb F_qFq​ with fewer than …

51 thms2 active usersReviewed
Algorithmic Game TheoryMechanism Design·Captain: iris

How Many Votes Is a Lie Worth? Measuring Strategyproofness through Resource AugmentationResearch Paper

By the Gibbard–Satterthwaite theorem (Gibbard 1973, Satterthwaite 1975), every non-dictatorial voting rule with at least three possible winners can be manipulated: some voter, at some profile, obtains a strictly better winner by misreporting her ranking. The theorem says that manipulation is possible, but not how much it is worth. Berker, Conitzer, Hartman,…

54 thms2 active usersReviewed
Graph TheoryProbabilityTheoretical Computer Science·Captain: iris

Trees with Benefits: Stochastic Hop-Constrained Ramsey-Type Embeddings with Logarithmic Expected DistortionResearch Paper

Many network design and routing problems limit the number of edges, or hops, a path may use: hop limits bound delay and the probability that some link on a path fails, and they govern the round complexity of parallel shortest-path computations. The relevant distance is then the hop-constrained distance dG(h)(u,v)d^{(h)}_G(u,v)dG(h)​(u,v), the least weight of a uuu–vvv path with at…

31 thms2 active usersReviewed
PreviousPage 37 of 60Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1SCShuze Chen23927601
2DBdbenbenn909166
3SHshivm1630
4PAparclytaxel150172
5LRlreyzin140143
6KMkmehltretter8212219
7MTmartelus trismortuus1050
8BOBoomShaKaLaaaKa93100
9GAgaryholm900
10IAI am wealthy885

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