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.

1360 open missions

Missions

676–700 of 1360
Open1360Completed139All1499
CombinatoricsComputational ComplexityProbability+1·Captain: Shuze Chen

Tight Bounds for Conservative Pointer JumpingResearch Paper

In the number-on-the-forehead (NOF) model of communication of Chandra, Furst and Lipton (CFL83), an input is split into kkk parts and each of kkk players sees every part except the one on its own forehead. Lower bounds in this model are hard to prove because the players' views overlap so much, and they would be valuable: by Yao (Yao90), Håstad and Goldmann (HG91…

19 thms2 active usersReviewed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: Shuze Chen

Recognizing Label-Connected GraphsResearch Paper

In the classical gossiping problem every participant holds one piece of information, and whenever two participants call each other they exchange everything they know. With all pairs allowed to call, 2n−42n - 42n−4 calls are necessary and sufficient for n≥4n \ge 4n≥4 participants (Baker–Shostak 1972; Hajnal–Milner–Szemerédi 1972). When the available calls are prescribed…

19 thms2 active usersReviewed
CombinatoricsOptimizationTheoretical Computer Science·Captain: Shuze Chen

Edit Distance Approximation: Subquadratic Factor Three and Monge Approximation SchemesResearch Paper

Weighted edit distance and other string alignment problems are computed by combining boundary-to-boundary distance matrices of planar alignment graphs. These matrices are Monge: Mij+Mi+1,j+1≤Mi,j+1+Mi+1,jM_{ij}+M_{i+1,j+1}\le M_{i,j+1}+M_{i+1,j}Mij​+Mi+1,j+1​≤Mi,j+1​+Mi+1,j​. For unweighted alignment, Tiskin showed that the matrices have a compact structure: O(n)O(n)O(n) space and O(nlog⁡n)O(n\log n)O(nlogn)-time min-plus products. That…

15 thms2 active usersReviewed
AnalysisMachine LearningProbability+1·Captain: Shuze Chen

Error accumulation in reverse diffusion with an imperfect score: beyond path-space analysesResearch Paper

Diffusion models generate samples from a data distribution ppp on Rd\mathbb R^dRd by running a stochastic differential equation backwards in time. The drift of the backward equation involves the score ∇log⁡pt\nabla\log p_t∇logpt​ of the noised data distribution, which is not known and is replaced by a neural-network estimate s^\hat ss^ trained by a squared loss. The standard…

18 thms2 active usersReviewed
Machine LearningMarkov ChainProbability+2·Captain: Shuze Chen

Averaged Annealed Markov Chains Achieve the Algorithmic Threshold for Tensor PCA, Part I: Glauber DynamicsResearch Paper

In tensor PCA (the spiked tensor model of Richard and Montanari, 2014) one observes an order-kkk tensor that is a rank-one signal buried in Gaussian noise and must recover the hidden direction. The model is a standard testbed for the gap between what is statistically possible and what efficient algorithms achieve. Weak recovery is information-theoretically…

21 thms2 active usersReviewed
CombinatoricsComputational ComplexityGraph Theory+1·Captain: Shuze Chen

Constrained Directed Separation: Algorithms and ClassificationsResearch Paper

Directed Multicut asks to delete at most kkk nonterminal vertices of a digraph so that no directed path remains from the first to the second terminal of any demand. Olkowski and Ramanujan study what happens when the deleted vertices must also satisfy a structural condition: the subdigraph they induce must belong to a fixed hereditary class H\mathcal HH.…

27 thms2 active usersReviewed
CombinatoricsComputational ComplexityGraph Theory+1·Captain: Shuze Chen

Once-Paid Subsequences and the Cost of Min-Plus ApproximationResearch Paper

Many sequence problems are solved by a prefix recurrence that uses only minimum and addition, and such a recurrence, once its structure is fixed before the costs are known, is a min-plus circuit. Lower bounds on min-plus circuits therefore say which recurrences cannot exist, independently of how clever the choice of states is (Jukna–Seiwert 2020).

18 thms2 active usersReviewed
Group TheoryQuantum InformationRepresentation Theory·Captain: mikedeng1

(Almost) quadruply optimal unitary designs in 1DResearch Paper

Random unitary operations are used in quantum benchmarking, learning and information processing. A generic Haar-random operation on n qubits requires an exponential number of elementary gates. A unitary design replaces that full distribution by an implementable ensemble whose low-order moments reproduce Haar randomness to a specified accuracy. The resource…

43 thms2 active usersReviewed
Complexity TheoryQuantum Information·Captain: mikedeng1

The Commuting Local Hamiltonian Problem: Relativized Evidence Against BQP-HardnessResearch Paper

The commuting local Hamiltonian problem asks whether local energy constraints that commute can all be approximately satisfied by a quantum state. It connects quantum many-body systems with the complexity of verifying quantum witnesses. The class QIMA expresses verification through commuting tests on a witness. Understanding which quantum computations fit…

23 thms2 active usersReviewed
Complexity TheoryProbability·Captain: mikedeng1

Exponential Sampling Lower Bounds for Polynomial SourcesResearch Paper

A randomized computation can generate a distribution without evaluating a prescribed function on a supplied input. Researchers studying the complexity of sampling therefore ask which distributions restricted computations can generate, even approximately. A polynomial source uses uniformly random bits as inputs and computes each output bit by a polynomial…

26 thms2 active usersReviewed
Quantum InformationStatistics·Captain: mikedeng1

Optimal single-copy estimation of quantum state moments: why Tr⁡(ρ3)\operatorname{Tr}(\rho^3)Tr(ρ3) and Tr⁡(ρ4)\operatorname{Tr}(\rho^4)Tr(ρ4) are equally hardResearch Paper

Quantum experiments often provide repeated preparations of one unknown state while restricting which copies can interact. A state moment is the nonlinear quantity pt(ρ)=Tr⁡(ρt)p_t(\rho)=\operatorname{Tr}(\rho^t)pt​(ρ)=Tr(ρt), where ttt is a positive integer. Purity is the case t=2t=2t=2. Such quantities describe spectral information that a single linear observable does not determine. The…

31 thms2 active usersReviewed
Complexity TheoryComputational Complexity·Captain: mikedeng1

From a finite subgroup of SO(3)SO(3)SO(3): C2C_2C2​ leads to a Holant dichotomyResearch Paper

A graph can describe a counting problem through local rules. For example, assigning a bit to each edge and requiring exactly one incident bit to be one at each vertex counts perfect matchings. More general rules attach a weight to each local assignment, and the answer sums products of these weights over all edge assignments. A Holant problem asks for this…

30 thms2 active usersReviewed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

The No-Menu Complexity of Revenue-Maximizing AuctionsResearch Paper

A revenue guarantee for an auction does not by itself say how much the seller and buyer must communicate. A familiar way to describe a deterministic auction is to give its menu of bundles and prices. That description treats the menu as already available to the buyer. When the seller chooses the menu using information unavailable to the buyer, learning…

21 thms2 active usersReviewed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Optimal Learning under Tsybakov NoiseResearch Paper

A binary classifier predicts one of two labels from an observed instance. Its training error can be minimized without knowing the distribution that will generate future observations. The statistical question is how much worse that empirical minimizer can be than the best prediction rule for the population. Tsybakov noise permits instances whose labels are…

10 thms2 active usersReviewed
Computational ComplexityGraph Theory·Captain: mikedeng1

Exact Mean Certificates under Sparse Graph CorruptionResearch Paper

A network of sensors can report a plausible average even when a few individual readings are arbitrary. A known bound on how much the true value changes across an edge supplies information beyond the reports. The question is then how much uncertainty about the network mean survives a particular observation. The distinction matters when an application needs…

32 thms2 active usersReviewed
Complexity TheoryOperations ResearchOptimization·Captain: mikedeng1

A Tight FPT Approximation for Capacitated k-MedianResearch Paper

In capacitated k-median one opens kkk facilities in a metric space and assigns every client to an open facility, minimizing the total client–facility distance, subject to a hard capacity UfU_fUf​ on the number of clients each facility may serve; each facility can be opened at most once. Because clients are no longer served by their nearest open facility, the cost…

25 thms2 active usersReviewed
Quantum Information·Captain: mikedeng1

Quantum Separability in Polynomial TimeResearch Paper

A bipartite quantum state describes two finite quantum systems jointly. Some states can be prepared by taking independent states of the two systems and mixing the resulting pairs with ordinary classical probabilities. Such states are separable. Determining whether a supplied state is separable asks whether its correlations admit this form of preparation.…

47 thms2 active usersReviewed
Information TheoryQuantum Information·Captain: mikedeng1

Tight Lower Bounds for State Tomography with Limited EntanglementResearch Paper

Quantum state tomography is the task of estimating an unknown quantum state from independently prepared copies. How many copies it needs depends on how many copies a single measurement may act on. If one joint measurement may act on all copies, order d2/ε2d^2/\varepsilon^2d2/ε2 copies are necessary and sufficient to learn a ddd-dimensional state to trace distance …

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

Online Graph Exploration under T-Interval ConnectivityResearch Paper

A mobile agent that discovers a network one hop at a time cannot plan from a complete map. If links change while it moves, connectivity at each instant does not by itself let the agent reach every vertex. This matters for the mathematical foundations of exploration in changing networks: the assumption must constrain how connectivity persists, rather than…

22 thms2 active usersReviewed
Information TheoryProbabilityStatistics·Captain: mikedeng1

Optimal Testing and Profile Recovery from Aggregated Binary Linear-Code SamplesResearch Paper

Aggregation can keep an algebraic distinction intact while making it statistically faint. In code-based masking, a secret is split into coordinates of a coset of a binary linear code, and a side channel reveals only aggregate Hamming-weight counts of the coordinates; how many observations an adversary or an evaluator needs to tell two configurations apart…

18 thms2 active usersReviewed
Graph TheoryTheoretical Computer Science·Captain: mikedeng1

Single-Exponential Algorithms for Directed Feedback Vertex Set on Planar DigraphsResearch Paper

A dependency system can contain directed cycles even when its underlying connections can be drawn without crossings. The directed feedback vertex set problem asks how many vertices must be removed to eliminate every such cycle. Its parameterized version asks for a set of at most a given budget kkk. The issue is whether the exponential part of the running time…

17 thms2 active usersReviewed
CombinatoricsComplexity Theory·Captain: mikedeng1

Streaming Weighted Set Cover Requires (Nearly) Linear SpaceResearch Paper

In streaming set cover, mmm sets over an nnn-element universe arrive one at a time; an algorithm makes a few passes with limited memory and must approximate the minimum total weight of a cover. Storing the input costs Θ(mn)\Theta(mn)Θ(mn) bits, the incidence matrix. Running time is unrestricted, so the question is purely about information: how much memory a given number…

12 thms2 active usersReviewed
Computational ComplexityQuantum Information·Captain: mikedeng1

Optimal Quantum Algorithms for Ordered SearchResearch Paper

Finding the first occurrence of a target in a sorted list is a basic comparison problem. Classical binary search uses logarithmically many comparisons. A quantum query can compare a superposition of positions, so the relevant question is how much this changes the coefficient of the logarithm when the answer must be correct with certainty. The held…

19 thms2 active usersReviewed
Complexity TheoryLinear algebra·Captain: mikedeng1

Matrix Multiplication from Polynomial Packings: A Constructive Proof of ω ≤ 9/4Research Paper

Matrix multiplication is a basic operation in algorithms and symbolic computation. Its arithmetic exponent asks how the number of scalar operations grows with matrix size, allowing a fixed positive slack in the exponent. A small exponent need not come with a usable finite identity over the coefficient domain of interest. For exact integer computation, the…

28 thms2 active usersReviewed
Computational ComplexityOptimization·Captain: mikedeng1

One-point value of a combinatorial generating series as a complexity measureResearch Paper

Many combinatorial problems ask for a cheapest feasible object, while their counting versions ask how many objects exist. The number of objects attaining the minimum is a third quantity: knowing one minimum value does not itself report its multiplicity. This mission concerns a generating function that records every feasible object's cost and asks what…

25 thms2 active usersReviewed
PreviousPage 28 of 55Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1SCShuze Chen23917600
2DBdbenbenn690113
3SHshivm1630
4PAparclytaxel150172
5MTmartelus trismortuus1050
6GAgaryholm900
7WCwcysai8486
8A1a142857a7518
9SCSenrui Chen6757
10BEbersubs6574

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