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.

1355 open missions

Missions

826–850 of 1355
Open1355Completed144All1499
CombinatoricsInformation TheoryProbability·Captain: mikedeng1

List Size of Random Linear Codes: Optimality and the Limits of Average-Radius List DecodingResearch Paper

A code is a collection of words used to distinguish messages after transmission errors. When errors make unique recovery impossible, list decoding permits several candidate messages. Its combinatorial requirement is that a ball around any received word contain only a limited number of codewords. Researchers in coding theory study how that list size grows as…

19 thms2 active usersReviewed
Convex OptimizationOptimization·Captain: mikedeng1

Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle RatesResearch Paper

A first-order oracle reveals an objective's value and one subgradient at a queried point. For a convex function, these observations support optimization without a formula for the function. The geometry of the feasible set matters: a Euclidean-Lipschitz objective on a small ℓ1 ball need not have the same query complexity as optimization on a Euclidean ball.…

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

New bounds for online coloring three-colorable graphsResearch Paper

A proper coloring assigns different colors to adjacent vertices of a graph. In the online vertex-coloring problem, vertices arrive one at a time with their edges to earlier vertices, and each color choice is immediate and irrevocable. The algorithm has to commit before learning which future vertices will connect to its current color classes. This separates…

12 thms2 active usersReviewed
Algorithmic Game TheoryComplexity TheoryTheoretical Computer Science·Captain: mikedeng1

Tarski Fixed Points in Quasi-FPT QueriesResearch Paper

Tarski's fixed point theorem says that every monotone map on a complete lattice has a fixed point. On the finite grid [n]k={1,…,n}k[n]^k=\{1,\dots,n\}^k[n]k={1,…,n}k with the coordinatewise order, finding such a fixed point captures several problems whose complexity is open: pure Nash equilibria of supermodular games, and the reductions of parity games, mean-payoff games, Condon's…

27 thms2 active usersReviewed
Complexity TheoryQuantum Information·Captain: mikedeng1

Quantum interaction can superactivate cheating under parallel repetitionResearch Paper

Parallel repetition is the standard way to amplify soundness: if two non-communicating provers cannot win a game with certainty, one expects them to be even less able to win many independent copies played at once. For classical games this is Raz's parallel repetition theorem. Bhattacharyya, Mančinska and Zhao show that this intuition fails badly for quantum…

20 thms2 active usersReviewed
Machine LearningQuantum Information·Captain: mikedeng1

Quantum 1-PCA with Pauli Measurements in Nearly Linear TimeResearch Paper

Quantum PCA asks for a classical description of the leading eigenvector of an unknown mixed state ρ\rhoρ on nnn qubits, given copies of ρ\rhoρ. The leading eigenvector is the best pure-state approximation of ρ\rhoρ, and recovering it is the natural task when the state of interest is pure but the prepared state is corrupted by noise or misspecification; it is…

21 thms2 active usersReviewed
Complexity TheoryMachine Learning·Captain: mikedeng1

Polynomial-Time Mistake-Bounded Language GenerationResearch Paper

Language generation in the limit (Kleinberg and Mullainathan, 2024) asks a learner who sees a stream of words of an unknown language LLL from a known family to output, from some point on, words of LLL it has not yet seen. Unlike Gold's identification in the limit, generation is possible for every countable family. Kleinberg, Peale and Reingold (arXiv:2605.10809,…

9 thms2 active usersReviewed
Complexity Theory·Captain: mikedeng1

Witness Isolation with Inverse-Polylogarithmic Success Implies NP in P/polyResearch Paper

A witness is a binary string certifying that an instance has a positive answer. For a Boolean circuit, a witness is an assignment on which the circuit outputs one. Many reductions in complexity theory become useful when exactly one witness survives. Witness isolation therefore asks for a procedure that restricts a satisfiable instance while retaining…

21 thms2 active usersReviewed
Complexity TheoryHarmonic AnalysisLinear algebra·Captain: mikedeng1

Lower Bounds for Memory-Efficient Differentially Private Continual CountingResearch Paper

Differentially private training of machine-learning models repeatedly releases noisy prefix sums of gradients. The mechanism with the best known accuracy for this task is the matrix mechanism: factor the prefix-sum matrix AnA_nAn​ as An=BCA_n=BCAn​=BC, and release B(Cx+z)=Anx+BzB(Cx+z)=A_nx+BzB(Cx+z)=An​x+Bz for Gaussian noise zzz. Fichtenberger, Henzinger and Upadhyay gave a lower-triangular Toeplitz sq…

37 thms2 active usersReviewed
Complexity TheoryProbability·Captain: mikedeng1

Random (log⁡n\log{n}logn)-CNF Formulas Are Hard for Depth-222 Frege with Modular GatesResearch Paper

A propositional contradiction can have very different proof lengths in different systems. Polynomial calculus measures the algebraic complexity of a contradiction by the largest polynomial degree needed to derive the constant one from its equations. For random formulas, the relevant question is whether many constraints make a contradiction easy to certify…

26 thms2 active usersReviewed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Is Randomness Necessary for Adaptive Data Analysis?Research Paper

A dataset is often reused to answer questions chosen after seeing earlier answers. Each answer can influence the next question, so the usual guarantee for one question fixed in advance does not automatically extend to the resulting interaction. Adaptive data analysis asks what a mechanism can reliably reveal about a population from a single finite sample in…

13 thms2 active usersReviewed
Complexity TheoryGraph Theory·Captain: mikedeng1

Testability of General Graphs with Weak Query OraclesResearch Paper

A graph property tester examines a small part of a graph and distinguishes graphs having a property from graphs requiring many changes to acquire it. Researchers studying sublinear graph algorithms need to know which properties admit a query bound independent of the number of vertices. That question depends on what a query reveals. An adjacency query can…

23 thms2 active usersReviewed
Computational ComplexityConvex OptimizationQuantum Information+1·Captain: mikedeng1

Quantum lower bounds for convex optimization and real matrix-vector query problemsResearch Paper

Convex optimization asks for a feasible point whose objective value is close to the smallest feasible value. When the objective is available only through queries, the number of queries describes how much information an algorithm needs about an unknown function. Quantum algorithms can query superpositions of points, so a classical query lower bound does not…

30 thms2 active usersReviewed
CombinatoricsProbability·Captain: mikedeng1

Algorithmic thresholds for finding large independent sets in random graphsResearch Paper

In a binomial random graph Gn,pG_{n,p}Gn,p​ the largest independent set has size about 2log⁡1/(1−p)(np)2\log_{1/(1-p)}(np)2log1/(1−p)​(np), while simple greedy procedures find one of size about half of that. Karp asked in 1976 whether an efficient algorithm can do better, and the question remains open. Since an unconditional answer is out of reach, current work asks which classes of algorithms can…

22 thms2 active usersReviewed
CombinatoricsComputational ComplexityGraph Theory·Captain: mikedeng1

Triangle-Freeness: Estimation Is as Easy as TestingResearch Paper

An algorithm examining a large graph may have time to inspect only a small part of its adjacency matrix. Property testing asks whether the graph has a specified property or requires a substantial number of edge changes to acquire it. Distance estimation asks how many changes are needed, to a prescribed additive accuracy. For triangle-freeness, a tester can…

17 thms2 active usersReviewed
Algorithmic Game TheoryOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Weakly Stable Roommates with Two Master Lists: Tractable Existence and Hard OptimizationResearch Paper

A roommates matching partitions a population into pairs. Each person ranks possible partners, and a proposed arrangement is stable when no two people both strictly prefer one another to their assigned partners. Preferences may contain ties. A person who is indifferent does not participate in a blocking pair on that comparison. This distinction matters when…

28 thms2 active usersReviewed
ProbabilityQuantum Information·Captain: mikedeng1

Near-Optimal Mixedness Testing with Pauli MeasurementsResearch Paper

An experimenter may need to determine whether a prepared quantum system is maximally mixed without reconstructing its entire state. The restriction on available measurements matters: measuring each qubit separately gives a different information budget from a measurement that jointly processes many qubits or many copies. Mixedness testing asks for a decision…

19 thms2 active usersReviewed
Graph TheoryProbability·Captain: mikedeng1

Exact Fully Dynamic Single-Source Shortest Paths in Nonnegative Weighted GraphsResearch Paper

Single-source shortest paths (SSSP) with nonnegative arc weights is a basic primitive of routing, navigation and graph analytics. In many applications the graph changes one arc at a time, and recomputing all distances with Dijkstra's algorithm in O(m+nlog⁡n)O(m+n\log n)O(m+nlogn) time (Fredman–Tarjan 1987) after every change discards the fact that most distances are unaffected.…

26 thms2 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

Online Service with Per-Batch Maximum DelaysResearch Paper

Online routing with waiting costs asks when a server should act and which requests it should serve together. The objective changes substantially when a service event pays only its oldest request's waiting time. Adding a younger request to that event can increase its movement cost without increasing its delay charge. Researchers studying online routing and…

22 thms2 active usersReviewed
Functional AnalysisMarkov ChainProbability·Captain: mikedeng1

Spectral gaps of Hit-and-Run and Coordinate Hit-and-RunResearch Paper

A uniform sampler produces random points whose probabilities are proportional to volume inside a prescribed region. This is a basic operation in randomized integration and volume computation. For a region described by constraints, a sampling step can be simple even when drawing an independent uniform point is difficult. The relevant question is how quickly…

19 thms2 active usersReviewed
Combinatoricscryptography·Captain: mikedeng1

The Authentication Complexity of Byzantine ConsensusResearch Paper

Byzantine agreement (BA) asks nnn parties, each holding an input bit, to output a common bit despite up to ttt parties behaving arbitrarily, with the common output equal to the honest parties' input whenever those inputs coincide. It is a building block of state-machine replication and secure multiparty computation. Its resilience depends on the initial…

25 thms2 active usersReviewed
Algorithmic Game TheoryMechanism Design·Captain: mikedeng1

Optimal Truthful Approximation for House Allocation and Rank-Maximal Matchings with TiesResearch Paper

In house allocation, agents rank objects and each agent can receive at most one object. A rule that chooses an allocation from reported rankings must account for the possibility that agents misreport. The mathematical question is how much allocation quality an incentive requirement necessarily costs. Zhang, Zhao, Xu, Xi and Zhao study this question both for…

24 thms2 active usersReviewed
Linear OptimizationOperations ResearchProbability·Captain: mikedeng1

Computing Weighted Set Covers with Heterogeneous Stochastic Oracles: Deadline-Constrained Token ComplexityResearch Paper

A weighted set cover instance consists of a finite universe of elements, a family of subsets whose union contains the universe, and a positive weight for each subset. A cover is a subfamily containing every element; its weight is the sum of its subset weights. A service that proposes a cover can be useful even when its answer is uncertain: the proposed…

16 thms2 active usersReviewed
cryptographyQuantum Information·Captain: mikedeng1

Anchoring the Security of Invariant Quantum MoneyResearch Paper

A public verifier lets anyone check a quantum banknote, while its security asks whether an efficient algorithm can turn one issued banknote into two accepted registers. For invariant quantum money, the banknote is a superposition of combinatorial objects sharing a public invariant. A classical description of one object therefore supplies useful information…

14 thms2 active usersReviewed
Quantum InformationQuantum Mechanics·Captain: mikedeng1

Scalable Passive QRAMResearch Paper

A quantum random access memory (QRAM) lets a quantum algorithm query classical data while its address is in superposition. Algorithms that assume such access need an implementation whose cost includes loading and retrieving the data. A device containing many components can still have a small cost per query: conventional memory changes only a small fraction…

25 thms2 active usersReviewed
PreviousPage 34 of 55Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1SCShuze Chen23917600
2DBdbenbenn691113
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