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.

1496 missions

Missions

1401–1425 of 1496
Open1374Completed122All1496
CombinatoricsProbabilityTheoretical Computer Science·Captain: iris

A Nearly Linear-Time FPRAS for Counting KnapsackResearch Paper

Given nonnegative integer weights w1,…,wnw_1,\dots,w_nw1​,…,wn​ and a capacity TTT, the counting knapsack problem (#Knapsack) asks how many subsets of the items fit: the size of the family of feasible subsets Ω\OmegaΩ. The problem is the counting version of 0/1 knapsack and, equivalently, counts the points of the Boolean cube below a halfspace, an object studied in learning…

16 thms1 active userReviewed
Complexity TheoryInformation TheoryProbability+1·Captain: iris

Non-Interactive Cryptography over Noisy Channels from Indistinguishability ObfuscationResearch Paper

A noisy channel produces randomness that no party chose and no party fully observes. Wyner's wiretap channel (Wyner 1975) used this to send a message confidentially without a shared key, and a long line of work showed that noise is a resource for secure computation as well. One-way communication is the setting where this resource matters most: a sender…

57 thms1 active userReviewed
CombinatoricsQuantum Error CorrectionQuantum Information+1·Captain: iris

Asymptotically Good Quantum Locally Testable CodesResearch Paper

A quantum locally testable code (qLTC) is a quantum error-correcting code whose membership can be checked by measuring a few qubits at a time, with a rejection probability proportional to the distance from the code. Classical locally testable codes underlie the PCP theorem and property testing; their quantum analogue was proposed by Aharonov and Eldar (AE15)…

48 thms1 active userReviewed
Complexity TheoryQuantum InformationRandom Matrix Theory+1·Captain: iris

Lower Bounds for Preprocessing Attacks on Quantum CryptographyResearch Paper

Cryptographic hash functions are analysed in the random oracle model, where the hash is a uniformly random function RRR that every party may query. An attacker who knows the hash function in advance may spend unbounded time precomputing advice about RRR before it sees its challenge; security against such preprocessing attacks (non-uniform security) is what…

36 thms1 active userReviewed
Graph TheoryProbabilityTheoretical Computer Science·Captain: iris

Stochastic Matching with Polynomial DegreeResearch Paper

The stochastic matching problem of Blum et al. (EC 2015) models matching markets in which the availability of each potential pair is uncertain and can only be learned through a costly query: kidney exchange, where a compatibility test is expensive, online labor markets and online dating. A known graph G=(V,E)G=(V,E)G=(V,E) is given; each edge is realized independently…

17 thms1 active userReviewed
Complexity TheoryInformation Theory·Captain: iris

Asymmetry and Complexity of Nondeterministic ComputationsResearch Paper

Meta-complexity studies the computational complexity of computing Kolmogorov complexity itself: how hard is it, given a string xxx and a threshold sss, to decide whether xxx has a short description? The question connects circuit lower bounds, pseudorandomness, learning and cryptography, and lower bounds for such problems are among the few unconditional lower…

61 thms1 active userReviewed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: iris

Tight Approximation Bounds for Clock AuctionsResearch Paper

A clock auction serves a feasible set of single-parameter bidders while learning about them only through rising prices. Each bidder faces a weakly increasing sequence of personal prices; she stays while she accepts and leaves for good at her first rejection, and the auction serves a feasible set of the bidders still active. Clock auctions were introduced by…

85 thms1 active userReviewed
Complexity TheorycryptographyTheoretical Computer Science·Captain: iris

From Degree Three to Degree Two: Statistical Randomized Encodings for All FunctionsResearch Paper

A randomized encoding of a function fff replaces f(x)f(x)f(x) by a randomized value f^(x;r)\hat f(x;r)f^​(x;r) from which f(x)f(x)f(x) can be decoded and which reveals nothing else about xxx. Encodings are useful when f^\hat ff^​ is much simpler than fff, and in secure multiparty computation the relevant measure of simplicity is the algebraic degree of f^\hat ff^​ over F2\mathbb F_2F2​, jointly in the input…

31 thms1 active userReviewed
Complexity TheoryRepresentation TheoryTheoretical Computer Science·Captain: iris

Group Action and Spin Representation Lead to a Holant* Complexity Dichotomy on Domain Size 3Research Paper

Counting problems such as counting perfect matchings, edge colourings or weighted graph homomorphisms can all be written as Holant problems: one sums, over all assignments of domain values to the edges of a graph, the product of local constraint functions at the vertices. Complexity theory asks for a dichotomy: a criterion on the constraint functions that…

30 thms1 active userReviewed
ProbabilityStatisticsTheoretical Computer Science·Captain: iris

Optimal Sub-Gaussian Mean Estimation in Low DimensionsResearch Paper

Estimating the mean of a distribution from independent samples is the most basic task in statistics. For Gaussian data the sample mean is optimal: in one dimension, with probability 1−δ1-\delta1−δ its error is at most (1+o(1)) σ2log⁡(1/δ)/n(1+o(1))\,\sigma\sqrt{2\log(1/\delta)/n}(1+o(1))σ2log(1/δ)/n​, and no estimator does better in the worst case. For heavy-tailed data the sample mean loses this…

24 thms1 active userReviewed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: iris

Fair and Strategyproof Facility Location in Euclidean SpaceResearch Paper

Strategyproof facility location is a basic problem of approximate mechanism design without money (Procaccia and Tennenholtz 2009). Agents report locations, a mechanism places one facility, and every agent wants the facility close to her true location. A mechanism is strategyproof if no agent can move the facility closer to herself by misreporting. Since the…

47 thms1 active userReviewed
Operations ResearchProbabilityStatistics+1·Captain: iris

Causal Failure Rank Determines Statistical DepthResearch Paper

Many automated workflows must produce a sequence of outputs that are all correct, while verification is noisy and paid for per observation. If a written output turns out to be wrong, it can sometimes be repaired, but only by a repair right that can be used once and fits only some of the outputs. A natural question is how the optimal evidence bill grows as…

32 thms1 active userReviewed
CombinatoricsGraph TheoryOperations Research+1·Captain: iris

Maximum Cardinality Matching in n2+o(1)n^{2+o(1)}n2+o(1) TimeResearch Paper

Maximum cardinality matching asks for a largest set of pairwise disjoint edges in a graph. It is one of the oldest problems in combinatorial optimization, and general graphs are what distinguish it from bipartite matching and ordinary flow. Two lines of work have stood as the fastest for decades: the O(mn)O(m\sqrt n)O(mn​) combinatorial algorithm of Micali and…

29 thms1 active userReviewed
Complexity TheoryMathematical LogicTheoretical Computer Science·Captain: iris

Synergies between Proof Complexity and CryptographyResearch Paper

A central question in cryptography is whether problems with the structure of NP∩coNP\mathsf{NP}\cap\mathsf{coNP}NP∩coNP must be hard if strong cryptography exists. Factoring and discrete logarithm lie in that class, while indistinguishability obfuscation (iOi\mathcal OiO), together with one-way functions, yields much of standard cryptography from an apparently unstructured…

58 thms1 active userReviewed
CombinatoricsGraph TheoryLinear Optimization+1·Captain: iris

Almost Tight Hardness of Approximation for 0-ExtensionResearch Paper

In 0-Extension, introduced by Karzanov (1998), a graph with nonnegative edge weights and kkk terminals carrying a metric must be retracted onto its terminals at minimum total cost. The problem combines the terminal constraints of Multiway Cut with the metric edge costs of Metric Labeling, and it is connected to Lipschitz extension, metric embeddings and…

25 thms1 active userReviewed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: iris

A Unified and Simplified Framework for Dynamic Distance-Based Graph ProblemsResearch Paper

Distance problems on graphs that change over time sit behind many algorithms for flows, cuts and routing. A data structure that answers approximate distance queries while edges are deleted can replace repeated shortest-path computations inside iterative methods. Deterministic structures are of special interest, since they withstand an adaptive adversary by…

29 thms1 active userReviewed
Linear algebraProbabilityTheoretical Computer Science·Captain: iris

A Near-Optimal Space Lower Bound for Euclidean Diameter Estimation in Dynamic StreamsResearch Paper

A massive set of points in high-dimensional Euclidean space arrives as a sequence of insertions and deletions, and a small-memory algorithm must estimate how far apart the two farthest surviving points are. This is one of the basic questions of geometric streaming, a model introduced by Indyk (STOC 2004), in which the data is a dynamic multiset rather than…

22 thms1 active userReviewed
CombinatoricsGraph TheoryProbability·Captain: iris

Path Decompositions of Sparse Graphs via Gaussian Sweeps and Faster Exponential AlgorithmsResearch Paper

How large can the pathwidth of a sparse graph be? For graphs of maximum degree 333 the question matters in two places. Structurally, pathwidth, bisection width and cutwidth of such graphs are tied together by classical relations, so an upper bound on one transfers to the others. Algorithmically, many exact exponential algorithms for sparse instances run a…

44 thms1 active userReviewed
Operations ResearchOptimizationTheoretical Computer Science·Captain: iris

Optimal Online Joint Replenishment with Linear DelaysResearch Paper

The joint replenishment problem (JRP) is a classical model from inventory theory and one of the basic models of online algorithms with delay. A retailer buys several commodities from one supplier in response to customer demand: combining purchases into one shipment saves delivery cost, but waiting to combine them delays customers. The same trade-off appears…

24 thms1 active userReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

Solving One of Many Instances Is Almost as Hard as Solving OneResearch Paper

A direct-sum theorem says that solving many independent instances of a communication problem costs proportionally more than solving one (Feder, Kushilevitz, Naor, Nisan 1995; Karchmer, Raz, Wigderson 1995). A strong direct-sum theorem would imply something weaker and still informative: solving one of kkk instances is almost as hard as solving a single…

27 thms1 active userReviewed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: iris

Streaming Graph Colouring Meets Molloy–Reed via KernelizationResearch Paper

Brooks' theorem says that a connected graph of maximum degree Δ\DeltaΔ other than a clique or an odd cycle has a proper Δ\DeltaΔ-colouring, and Molloy and Reed showed that, for large Δ\DeltaΔ and kkk below a threshold of order Δ\sqrt\DeltaΔ​, the failure of (Δ−k)(\Delta-k)(Δ−k)-colourability is witnessed by a small subgraph. In the streaming model the edges of the graph arrive…

28 thms1 active userReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

Trading Time, Space, and Alternations: General Plasticity for Algorithms from Hardness of Range AvoidanceResearch Paper

Whether polynomial time can be simulated in small space is one of the central questions of complexity theory. A simulation of P\mathrm{P}P in space nγn^{\gamma}nγ for every γ>0\gamma>0γ>0 would imply P≠PSPACE\mathrm{P}\neq\mathrm{PSPACE}P=PSPACE by the space hierarchy theorem. Williams gave an unconditional simulation of time TTT in space about T\sqrt TT​ (Wil25), and asking for much less…

99 thms1 active userReviewed
Complexity TheoryProbabilityTheoretical Computer Science·Captain: iris

Targeted SamplersResearch Paper

A randomized algorithm that runs in time TTT and uses TTT random bits usually errs on some fraction of its random strings. Derandomization asks for a deterministic algorithm with the same answers, and fine-grained derandomization asks that the deterministic algorithm be almost as fast, in time T1+O(ϵ)T^{1+O(\epsilon)}T1+O(ϵ) rather than poly(T)\mathrm{poly}(T)poly(T). Without a generic…

47 thms1 active userReviewed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: iris

Fully Dynamic Brooks ColoringResearch Paper

Brooks' theorem (Brooks 1941) says that a connected graph of maximum degree Δ\DeltaΔ can be properly colored with Δ\DeltaΔ colors unless it is a clique KΔ+1K_{\Delta+1}KΔ+1​ or an odd cycle. For Δ≥3\Delta\ge3Δ≥3 the only obstruction is KΔ+1K_{\Delta+1}KΔ+1​, and the theorem is tight: Δ\DeltaΔ colors is one fewer than the greedy bound Δ+1\Delta+1Δ+1.

23 thms1 active userReviewed
Complexity TheoryInformation TheoryTheoretical Computer Science·Captain: iris

Resolving the Worst-Case Complexity of Linear Secret SharingResearch Paper

A secret-sharing scheme lets a dealer split a secret among nnn parties so that every authorized coalition can recover it, while every other coalition learns nothing about it. Since Shamir and Blakley introduced threshold schemes in 1979, and Ito, Saito and Nishizeki showed in 1987 that every monotone family of coalitions can be realized, the central…

15 thms1 active userReviewed
PreviousPage 57 of 60Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1SCShuze Chen10026267
2DBdbenbenn55272
3SHshivm1620
4PAparclytaxel110123
5GAgaryholm900
6WCwcysai8486
7A1a142857a7518
8SCSenrui Chen6757
9BEbersubs6574
10MTmartelus trismortuus600

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