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

701–725 of 1360
Open1360Completed139All1499
Formal VerificationGraph TheoryTheoretical Computer Science·Captain: mikedeng1

Büchi Determinization with Optimal States and Square Root Index ImprovementResearch Paper

Automata on infinite words describe behavior that continues indefinitely. In formal verification, a system execution is such a word, and an acceptance condition expresses a property of its long-term behavior. Converting a nondeterministic automaton to a deterministic one can make subsequent operations possible, but the conversion has two costs: the number…

28 thms2 active usersReviewed
cryptographyQuantum Information·Captain: mikedeng1

Proof of Quantum Work with Classical VerificationResearch Paper

A proof of quantum work is a classical record whose production requires quantum computation and whose validity can be checked publicly. A separation between classical and quantum algorithms establishes that quantum capability helps, but does not quantify how much quantum computation a successful producer needs. For a mining puzzle, that distinction matters:…

8 thms2 active usersReviewed
Information TheoryMachine LearningTheoretical Computer Science·Captain: iris

Information Required to Preserve Past LearningResearch Paper

A model that is updated for a new task should not forget the tasks it was trained on before. Continual-learning and post-training methods differ in what they keep about the past: elastic weight consolidation (Kirkpatrick et al., 2017) keeps diagonal Fisher penalties around the checkpoint, replay and full-Hessian methods keep raw examples or full quadratic…

34 thms2 active usersReviewed
CombinatoricsComputational GeometryOperations Research+1·Captain: iris

Subset Sum in Almost-Linear TimeResearch Paper

Subset Sum asks, for integers 1≤a1,…,an≤Δ1\le a_1,\dots,a_n\le\Delta1≤a1​,…,an​≤Δ and a target ttt, whether some sub-collection sums to ttt. It is NP-hard, but solvable in pseudopolynomial time: Bellman's dynamic program takes O(n2Δ)O(n^2\Delta)O(n2Δ) time. The fine-grained question is how fast it can be solved in terms of nnn and Δ\DeltaΔ. Under the Strong Exponential Time Hypothesis no …

31 thms2 active usersReviewed
CombinatoricsMarkov ChainProbability+1·Captain: iris

An O~(n3)\widetilde{O}(n^3)O(n3)-time FPRAS for the PermanentResearch Paper

The permanent of an n×nn\times nn×n matrix A=(aij)A=(a_{ij})A=(aij​) is per(A)=∑σ∈Sn∏i=1nai,σ(i)\mathrm{per}(A)=\sum_{\sigma\in S_n}\prod_{i=1}^n a_{i,\sigma(i)}per(A)=∑σ∈Sn​​∏i=1n​ai,σ(i)​. For a 0/1 matrix it counts the perfect matchings of the bipartite graph G=(V1∪V2,E)G=(V_1\cup V_2,E)G=(V1​∪V2​,E) whose adjacency matrix is AAA. Valiant showed in 1979 that computing it exactly is #P-complete even for 0/1 matrices, so the question became how fast it…

30 thms2 active usersReviewed
Machine LearningProbabilityTheoretical Computer Science·Captain: iris

Polynomial Memory-Sample Separations in Non-i.i.d. Ill-Conditioned RegressionResearch Paper

Linear regression from a stream of samples is the simplest learning task in which memory and data trade off against each other. A learner that stores every sample, or runs Gaussian elimination, recovers an unknown vector x⋆∈Rdx^\star\in\mathbb R^dx⋆∈Rd from about ddd noiseless samples (at,at⊤x⋆)(a_t,a_t^\top x^\star)(at​,at⊤​x⋆) but needs about d2log⁡dd^2\log dd2logd bits of memory. Iterative methods…

28 thms2 active usersReviewed
Discrete GeometryOperations ResearchProbability·Captain: iris

Separating Measures by HyperplanesResearch Paper

Given red and blue points in Rd\mathbb R^dRd, join every red point to every blue point by a segment and weigh each segment by its length under a fixed norm. What fraction of the total weight can a single affine hyperplane always cut, counting a segment when its endpoints lie strictly on opposite sides? Correa, Griesbach, Harb, Hommelsheim, Jlibene, Livanos and…

26 thms2 active usersReviewed
AlgebraComplexity TheoryTheoretical Computer Science·Captain: iris

A Dichotomy Theorem for CSP-Based Ideal MembershipResearch Paper

The ideal membership problem asks whether a polynomial f0f_0f0​ lies in the ideal generated by given polynomials. Constraint satisfaction gives a natural family of instances: over a finite domain D⊆QD\subseteq\mathbb QD⊆Q, the domain and the constraints of a CSP instance PPP are polynomial equations, and they generate a radical ideal I(P)I(P)I(P) consisting exactly of the…

31 thms2 active usersReviewed
Machine LearningProbabilityStatistics+1·Captain: iris

Learning Positive Linear Combinations of ReLUs in Fully Polynomial TimeResearch Paper

A one-hidden-layer network with ReLU activation σ(t)=max⁡{0,t}\sigma(t)=\max\{0,t\}σ(t)=max{0,t} and nonnegative output weights computes a positive linear combination of ReLUs. Learning this class under Gaussian inputs is the simplest extension of learning a single neuron (a generalized linear model). Chen, Klivans and Meka (CKM22) call a polynomial-time algorithm for arbitrary sums…

33 thms2 active usersReviewed
Markov ChainProbability·Captain: Shuze Chen

Fine-Grained Complexity Across the Computational Phase TransitionResearch Paper

The hard-core model on a graph GGG is the law of a random independent set III with probability proportional to λ∣I∣\lambda^{|I|}λ∣I∣. It is the basic repulsive spin system of statistical physics and a central test case for approximate sampling and counting. For graphs of maximum degree d≥3d\ge3d≥3 the threshold λc(d)=(d−1)d−1/(d−2)d\lambda_c(d)=(d-1)^{d-1}/(d-2)^dλc​(d)=(d−1)d−1/(d−2)d, the uniqueness threshold of…

22 thms2 active usersReviewed
CombinatoricsMarkov ChainProbability+1·Captain: Shuze Chen

Discrete Isoperimetric Inequalities via CurvatureResearch Paper

Isoperimetric inequalities on the Boolean hypercube relate the variance of a Boolean function f:{±1}n→{±1}f:\{\pm1\}^n\to\{\pm1\}f:{±1}n→{±1} to how often flipping one coordinate changes its value. They drive sharp-threshold theorems, junta approximation, noise sensitivity, percolation, social choice and hardness of approximation (O'Donnell, Analysis of Boolean Functions, 2014).…

23 thms2 active usersReviewed
Computational ComplexityLinear algebraProbability+1·Captain: Shuze Chen

Quadratic ExtractorsResearch Paper

Randomized algorithms, cryptography and distributed protocols assume access to uniform random bits, while physical sources of randomness are biased and correlated. A randomness extractor is a deterministic function that turns samples of such a weak source into nearly uniform bits. No single extractor works for every source with a given amount of entropy:…

25 thms2 active usersReviewed
Graph TheoryOperations ResearchOptimization+1·Captain: Shuze Chen

Breaching the 2-Approximation Barrier for Prize-Collecting Steiner ForestResearch Paper

Prize-Collecting Steiner Forest (PCSF) is a network design problem: connect demand pairs in a graph by buying edges, where a pair may also be left unconnected at the cost of its penalty. It contains Steiner Tree and Steiner Forest, so it is NP-hard and APX-hard (Karp 1972); approximation algorithms are the standard way to handle it.

18 thms2 active usersReviewed
Graph TheoryOperations ResearchTheoretical Computer Science·Captain: Shuze Chen

Faster Algorithms for Minimum Degree Spanning TreeResearch Paper

In the minimum degree spanning tree (MDST) problem one is given a connected undirected graph G=(V,E)G=(V,E)G=(V,E) with n=∣V∣n=|V|n=∣V∣ nodes and m=∣E∣m=|E|m=∣E∣ edges and seeks a spanning tree whose largest node degree is as small as possible. The optimum

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

Deterministic Connectivity Sketches Under Edge DeletionsResearch Paper

A graph is to be compressed so that, after any set of its edges is deleted, one can still tell whether the remaining graph is connected. The question links one-way communication, fault-tolerant connectivity oracles, and single-pass dynamic graph streaming. With randomness it is well understood: the linear sketches of Ahn, Guha and McGregor (AGM12) use …

25 thms2 active usersReviewed
Markov ChainProbabilityStatistics·Captain: Shuze Chen

Identity Testing of Markov Chains from a Single TrajectoryResearch Paper

A common statistical question about a stochastic system is whether its dynamics agree with a reference model. Examples are a calibrated queueing simulator, a fitted mobility model, or a Markov chain Monte Carlo sampler that is supposed to implement a known kernel. Often the only data is one trajectory: the chain cannot be restarted, its initial state is not…

21 thms2 active usersReviewed
AlgebraComputational ComplexityTheoretical Computer Science·Captain: Shuze Chen

Deterministic Algorithms for Low Individual Degree Factors of Sparse PolynomialsResearch Paper

Factoring multivariate polynomials is a basic task of computer algebra. For polynomials given by circuits or as black boxes it has efficient randomized algorithms (Kaltofen; Kaltofen–Trager), surveyed in §1 of the source, but no deterministic one is known even for sparse polynomials, those with few monomials. Derandomizing factorization is tied to…

23 thms2 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: Shuze Chen

Monotone Local Search with Sample-Dependent Running TimesResearch Paper

Many exact exponential-time algorithms solve a subset problem: the solutions of an instance are subsets of a universe of nnn elements, and the task is to decide whether a solution of a given size kkk exists. Monotone Local Search (Fomin, Gaspers, Lokshtanov, Saurabh, J. ACM 2019) turns an extension algorithm into a subset algorithm. The extension algorithm is…

11 thms2 active usersReviewed
AlgebraComputational ComplexityLinear algebra+1·Captain: Shuze Chen

Hitting Sets for Polynomials with Small Hasse Derivative Space over Arbitrary Characteristic FieldsResearch Paper

Polynomial identity testing (PIT) asks whether a polynomial given by an algebraic circuit is the zero polynomial. In the blackbox setting the circuit can only be evaluated. A hitting set supplies a fixed family of queries that detects every nonzero polynomial in the class. A standard way to do so is a hitting set generator: a low-degree polynomial map GGG in…

24 thms2 active usersReviewed
cryptographyInformation TheoryTheoretical Computer Science·Captain: iris

Shannon Rate Seeded Codes from Indistinguishability ObfuscationResearch Paper

A sender encodes a message x∈{0,1}kx\in\{0,1\}^kx∈{0,1}k into a codeword of length NNN, and a channel may flip up to pNpNpN bits. If the bits are flipped independently at random (Shannon's model), efficient codes reach the Shannon capacity R=1−H(p)R=1-H(p)R=1−H(p) for every p<1/2p<1/2p<1/2, where HHH is the binary entropy function in bits. If the channel chooses the error pattern adversarially (Hamming's…

42 thms2 active usersReviewed
AlgebraComputational ComplexityTheoretical Computer Science·Captain: Shuze Chen

Uniform Subpower Membership for Finite Mal'tsev AlgebrasResearch Paper

A finite algebra AAA is a finite set with finitely many operations. Given tuples g1,…,gm∈Ang^1, \dots, g^m \in A^ng1,…,gm∈An, the subpower membership problem asks whether a target tuple can be obtained from them by applying the operations of AAA coordinatewise, any number of times. The set of obtainable tuples, Sg(G)\mathrm{Sg}(G)Sg(G), can have exponentially many elements in nnn, so the…

13 thms2 active usersReviewed
Complexity TheoryComputational ComplexityTheoretical Computer Science·Captain: Shuze Chen

A Little Derandomization Goes a Long Way: Unconditional Circuit Lower Bounds using Low-Degree PITResearch Paper

Two lower-bound questions have resisted decades of work. The first is Boolean: does every problem solvable in nondeterministic exponential time have small Boolean circuits? The second is algebraic: Valiant's conjecture that VP≠VNP\mathrm{VP}\neq\mathrm{VNP}VP=VNP, i.e. that some explicit polynomials (the permanent, the Hamiltonian cycle polynomial) cannot be computed…

22 thms2 active usersReviewed
Algorithmic Game TheoryComputational ComplexityProbability·Captain: Shuze Chen

On the Computation of Sparse Equilibria in Normal-Form GamesResearch Paper

Correlated equilibria (CE) and coarse correlated equilibria (CCE) of a normal-form game are computable in polynomial time by linear programming, and no-regret dynamics converge to them. The price is the representation: an equilibrium found this way may correlate the players arbitrarily, through a joint distribution over action profiles whose support grows…

31 thms2 active usersReviewed
Machine LearningProbabilityStatistics·Captain: Shuze Chen

Minimax Rates for Estimation of Average Treatment Effects in Observational StudiesResearch Paper

Estimating the average treatment effect (ATE) from observational data is a central task of causal inference in medicine, economics and the social sciences. Without randomization, treatment and outcome may both depend on the covariates, and the effect is identified only under unconfoundedness and overlap (Rosenbaum and Rubin 1983). Standard estimators first…

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

Obfuscation via Proofs of Equivalence and Polynomial-Time Reductions to Falsifiable AssumptionsResearch Paper

Indistinguishability obfuscation (iO) compiles a circuit into a functionally equivalent one so that the compiled versions of any two equivalent circuits of the same size cannot be told apart. Constructions of iO from well-studied assumptions are complicated and rest on assumptions whose security reductions take exponential time in the input length. Jain and…

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