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

926–950 of 1355
Open1355Completed144All1499
Complexity TheoryProbabilityTheoretical Computer Science·Captain: iris

Sampling Tools and the Power of AC0Research Paper

A sampler is a device that turns uniform random bits into a sample of a target distribution. Asking which distributions a restricted class of devices can sample, exactly or approximately, is the sampling analogue of asking which functions it can compute. The two questions behave differently: some distributions that look hard can be sampled by very weak…

27 thms2 active usersReviewed
CombinatoricsComplexity TheoryProbability+1·Captain: iris

A Deterministic Approximation Scheme for Counting Read-Twice CNF AssignmentsResearch Paper

A CNF formula is read-twice when every variable has at most two literal occurrences, with any signs and any clause lengths. Two classical counting problems are special cases. If the two occurrences of every repeated variable have the same sign, complementing variables gives the monotone edge-cover model; if they have opposite signs, the clauses describe sink…

26 thms2 active usersReviewed
Linear algebraQuantum InformationTheoretical Computer Science·Captain: iris

Optimal Quantum de Finetti Theorems via Argmax RoundingResearch Paper

A quantum de Finetti theorem says that the few-site marginals of a permutation-symmetric many-site quantum state are close to mixtures of product states. Such theorems are the standard tool for reducing statements about symmetric or highly extendible states to statements about product states: they underlie the analysis of the Doherty–Parrilo–Spedalieri…

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

Bellman-Ford in Almost-Linear TimeResearch Paper

Single-source shortest paths with real, possibly negative, arc weights is a basic subroutine of network optimization. Negative weights arise in minimum-cost flow, in reduced costs of linear programs on networks, and in difference constraints. For decades the only general algorithm was Bellman–Ford, with O(mn)O(mn)O(mn) time on nnn vertices and mmm arcs. When weights are…

27 thms2 active usersReviewed
Graph TheoryProbabilityRandom Matrix Theory+1·Captain: iris

Bethe Hessian Recovery through the Kesten–Stigum RegimeResearch Paper

The stochastic block model (SBM) is the standard test case for graph partitioning: vertices carry hidden community labels, and edges appear independently with probabilities that depend on the labels. In the sparse regime, where every vertex has bounded expected degree ddd, exact recovery is impossible (some vertices are isolated), and the question is weak…

38 thms2 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: iris

Temporal Aggregation: Maintaining Randomness against Adaptive AdversariesResearch Paper

Many dynamic algorithms keep a random object alive while the input changes: random walks used for routing in expanders, random palettes for graph coloring, random paths for oblivious routing. Their analysis is usually static: if every object is sampled once, at the same moment, from its current distribution, then some load (edge congestion, the number of…

14 thms2 active usersReviewed
Computational GeometryOperations ResearchOptimization+1·Captain: iris

Inapproximability of Euclidean Steiner TreeResearch Paper

The Euclidean Steiner Tree problem asks for a shortest network connecting nnn given points (terminals) in Rd\mathbb R^dRd, where additional Steiner points may be placed anywhere. It goes back to the Fermat–Torricelli problem, and it is NP-hard already in the plane (Garey, Graham and Johnson, 1977). In fixed dimension it admits a polynomial-time approximation…

30 thms2 active usersReviewed
CombinatoricsComplexity TheoryGraph Theory+1·Captain: iris

NP-hardness of additive approximation for generalized Turán problemsResearch Paper

Graph modification problems ask how far an input graph is from a property. For the property of being F\mathcal FF-free, Alon, Shapira and Sudakov proved that when no member of the family F\mathcal FF is bipartite, the minimum number of edge deletions that make a graph F\mathcal FF-free is NP-hard to compute, and even to approximate within an additive error …

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

Approximating Transcendence Degree in Medium CharacteristicResearch Paper

Deciding whether polynomials f1,…,fm∈F[x1,…,xn]f_1,\dots,f_m\in\mathbb F[x_1,\dots,x_n]f1​,…,fm​∈F[x1​,…,xn​] satisfy a polynomial relation, and computing their transcendence degree, is a basic problem in algebraic complexity theory. It underlies algebraic independence testing and rank extractors for polynomial sources (Dvir, Gabizon, Wigderson 2009), and the Jacobian is the standard tool for…

22 thms2 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: iris

Testing Monotonicity of Real-Valued Functions on DAGsResearch Paper

Testing monotonicity is a standard problem in property testing: decide from a small number of function values whether a function respects a partial order or is far from every function that does. It was first studied on the Boolean hypercube and on product domains (Goldreich, Goldwasser, Lehman, Ron and Samorodnitsky, Combinatorica 2000), and later on…

38 thms2 active usersReviewed
Complexity TheoryProbabilityTheoretical Computer Science·Captain: iris

Tight Depth Lower Bounds for Stretch AmplificationResearch Paper

A pseudorandom generator (PRG) with stretch n↦Nn\mapsto Nn↦N is an efficiently computable function G:{0,1}n→{0,1}NG:\{0,1\}^n\to\{0,1\}^NG:{0,1}n→{0,1}N, N>nN>nN>n, whose random outputs no polynomial-time observer can tell from uniform NNN-bit strings. A generator of very small stretch n↦n+1n\mapsto n+1n↦n+1 is often considerably easier to build from a hardness assumption, while key applications need a larger…

28 thms2 active usersReviewed
Complexity TheoryMachine LearningTheoretical Computer Science·Captain: iris

New Gate, Weight and Wire Complexity Bounds for Sigmoid Neural NetworksResearch Paper

Neural networks with the sigmoid activation are real-valued circuits, and their expressive power can be compared directly with that of the Boolean threshold circuits studied in complexity theory. Parity is the classical test case. Threshold circuits of any constant depth need super-linearly many wires to compute it (Impagliazzo, Paturi, Saks 1997), even on…

34 thms2 active usersReviewed
Information TheoryProbabilityTheoretical Computer Science·Captain: iris

On the most informative Boolean function under noiseResearch Paper

A uniformly random string X∈{0,1}nX\in\{0,1\}^nX∈{0,1}n is sent through a binary symmetric channel: each coordinate is flipped independently with probability ppp, producing YYY. A single bit CCC is then computed from YYY. How much can one bit of the noisy output reveal about the input? Courtade and Kumar asked this in 2013 and conjectured that a dictator bit C=Y1C=Y_1C=Y1​ is optimal:

24 thms2 active usersReviewed
Condensed Matter PhysicsMathematical PhysicsQuantum Information·Captain: iris

Weakly interacting fermionic Gibbs states are Gaussian mixtures and classically simulableResearch Paper

Simulating interacting fermions at finite temperature is a central computational problem of condensed matter physics, quantum chemistry and nuclear physics, and general interacting fermionic problems are computationally hard in the worst case. Free fermions are the classical exception: their Gibbs states are fermionic Gaussian states, which are determined…

19 thms2 active usersReviewed
Complexity TheoryNumber TheoryTheoretical Computer Science·Captain: iris

Doubly-Efficient Private Information Retrieval from Modular FormsResearch Paper

A private information retrieval (PIR) protocol lets a user read bit iii of an nnn-bit database held by sss servers, while each server learns nothing about iii (Chor, Goldreich, Kushilevitz, Sudan 1995). If the servers store only the database, every server must touch every bit: otherwise it learns which locations the user is not reading (Beimel, Ishai, Malkin 2004). …

30 thms2 active usersReviewed
Complexity TheoryNumber TheoryTheoretical Computer Science·Captain: iris

Deterministic Construction of Primes in Subexponential TimeResearch Paper

With randomness, finding an nnn-bit prime is easy: sample O(n)O(n)O(n) integers and test each with the polynomial-time test of Agrawal, Kayal and Saxena. Deterministically, the problem is a standard example of an explicit construction: the property is dense and decidable in polynomial time, yet no fast procedure was known to produce a member of it. It is Open Problem…

38 thms2 active usersReviewed
Harmonic AnalysisProbabilityQuantum Information·Captain: iris

Robust quantum state certification and uncertainty principles for total influenceResearch Paper

State certification asks whether a laboratory state ρ\rhoρ is close to a pure target state ∣ψ⟩|\psi\rangle∣ψ⟩. It is a basic benchmark for quantum devices (Badescu, O'Donnell, Wright 2019; Kliesch, Roth 2021). The optimal test is the projective measurement {∣ψ⟩⟨ψ∣,1−∣ψ⟩⟨ψ∣}\{|\psi\rangle\langle\psi|,1-|\psi\rangle\langle\psi|\}{∣ψ⟩⟨ψ∣,1−∣ψ⟩⟨ψ∣}, but implementing it is in general as hard as…

40 thms2 active usersReviewed
Algorithmic Game TheoryMechanism DesignTheoretical Computer Science·Captain: iris

Lipschitz Stable Combinatorial AuctionsResearch Paper

Welfare-maximizing auctions are discontinuous. With two bidders and one item, the values (1+δ,1)(1+\delta,1)(1+δ,1) send the item to the first bidder and the values (1,1+δ)(1,1+\delta)(1,1+δ) send it to the second, however small δ\deltaδ is. Reports are often estimates, and sellers and buyers act on the probabilities of an allocation before it is realized, so such a jump makes plans…

57 thms2 active usersReviewed
Algorithmic Game TheoryOperations ResearchProbability+1·Captain: iris

Single-or-Sample: Online Fair Allocation for Combinatorial AgentsResearch Paper

Consider a relief center that hands out indivisible supplies to people arriving over time, each with different needs. Everything handed out is gone, and nothing is known about who comes next. Maximin share (MMS) fairness, introduced by Budish 2011, measures an agent's share using only that agent's own valuation: the value the agent could guarantee by…

32 thms2 active usersReviewed
Graph TheoryMarkov ChainProbability+1·Captain: iris

A simple proof of rapid mixing on random regular graphs beyond uniquenessResearch Paper

The hard-core model on a graph is the distribution on independent sets weighted by λ∣I∣\lambda^{|I|}λ∣I∣, and it is the central test case for sampling from distributions on combinatorial structures. Glauber dynamics, which resamples one vertex at a time, is the standard sampler. As surveyed in §1 of arXiv:2606.27545, on graphs of maximum degree Δ\DeltaΔ the…

31 thms2 active usersReviewed
Graph TheoryOperations ResearchOptimization+1·Captain: iris

Nearly Exact Length Bounds for Directed Steiner Tree and Forest in Planar GraphsResearch Paper

In length-constrained network design one buys arcs of a graph so that every demand can be routed along a short path. Each arc carries two separate numbers, a purchase cost and a travel length, and the bought arcs are shared: an arc used by many demands is paid once. The difficulty is that sharing and shortness pull in opposite directions. Buying each…

66 thms2 active usersReviewed
Operations ResearchOptimizationTheoretical Computer Science·Captain: iris

A tight approximation for metric k-means via squared tapered roundingResearch Paper

Metric k-means with candidate centers asks for kkk centers, chosen from a given finite set of candidates, that minimize the sum of squared distances from the clients to their nearest chosen center. It is the discrete, general-metric version of the k-means clustering objective, and a standard test case for LP rounding in approximation algorithms.

29 thms2 active usersReviewed
CombinatoricsComplexity TheoryTheoretical Computer Science·Captain: iris

Optimal Shallow Circuits for MajorityResearch Paper

Constant-depth circuits (AND and OR gates of unbounded fan-in over input literals, arranged in a fixed number of layers) are the model in which complexity theory has its strongest unconditional lower bounds. Håstad's switching lemma (Håstad 1986) shows that Parity needs depth-ddd circuits of size 2Ω(n1/(d−1))2^{\Omega(n^{1/(d-1)})}2Ω(n1/(d−1)), and a divide-and-conquer construction (…

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

Should We Combine Our Data? Algorithms and Limits for Privately Assessing Data SharingResearch Paper

Two organizations that each hold a labelled dataset often want to know, before any costly data-sharing agreement, whether their data are compatible: whether one classifier from a fixed class fits both datasets at once. Answering this question by exchanging the data defeats its purpose, since the records are private. Haghifam, Patel, Blum, Fanti and Ziani (ar…

30 thms2 active usersReviewed
CombinatoricsComplexity TheoryGraph Theory·Captain: iris

Stability Meets Kernelization: Algorithmic Extensions of the Lovász and Erdős–Goodman–Pósa TheoremsResearch Paper

Edge Clique Cover (ECC) asks for the fewest cliques of a graph GGG whose edge sets together cover E(G)E(G)E(G); the optimum ecc(G)\mathrm{ecc}(G)ecc(G) is also the intersection number of GGG. It was studied by Erdős, Goodman and Pósa in 1966 (EGP66) and is NP-complete even on chordal, split and comparability graphs. Parameterized by the cover size kkk it has a kernel with 2k2^k2k vertice…

44 thms2 active usersReviewed
PreviousPage 38 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