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

276–300 of 1496
Open1376Completed120All1496
Computational ComplexitycryptographyTheoretical Computer Science·Captain: mikedeng1

Hardness of Unique Shortest Vectors and Bounded Distance DecodingResearch Paper

Short lattice vectors and nearby lattice points are the basic computational objects of lattice algorithms and lattice-based cryptography [MG02]. Two promises are expected to make them easier to find. In the unique shortest vector problem (uSVP), every lattice vector off the line of a shortest vector is longer by a fixed factor Γ\GammaΓ. In bounded distance…

32 thms3 active usersReviewed
Complexity TheoryQuantum Information·Captain: mikedeng1

Unitary Synthesis with a PSPACE OracleResearch Paper

The Unitary Synthesis Problem of Aaronson and Kuperberg (AK07, Section 7) asks whether every unitary, computable or not, can be implemented in polynomial time with a suitable classical oracle. The difficulty is that a classical oracle answers questions about strings, while the state to be transformed cannot be read. No circuit with one query of polynomial…

48 thms3 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: Shuze Chen

A Unified and Robust Theory of Lower and Upper Bounds for the √log n BarrierResearch Paper

Many basic problems on packed strings and on planar point sets have the same best known running time on the word RAM: O(mlog⁡m)O(m\sqrt{\log m})O(mlogm​), where mmm is the input size in machine words. Examples are dictionary matching on a packed text, building the Burrows–Wheeler transform (BWT) of a packed binary string, the LZ77 factorization, counting inversions in an array…

68 thms3 active usersReviewed
Computational ComplexityComputational GeometryOperations Research+1·Captain: Shuze Chen

Near-Optimal Makespan and Parameterized Hardness for Multi-Robot Motion PlanningResearch Paper

Moving several robots through a shared workspace without collisions is a basic problem of robotics and computational geometry. Deciding whether one arrangement of robots can be transformed into another is PSPACE-hard when the number of robots is part of the input, so attention turns to a small number kkk of robots. Known algorithms for kkk square robots in a…

25 thms3 active usersReviewed
Complexity TheorycryptographyQuantum Information+1·Captain: Shuze Chen

Post-Quantum Perfect Zero-Knowledge Arguments for NP From Any One-Way PermutationResearch Paper

A zero-knowledge argument lets a prover convince a verifier that a statement xxx belongs to an NP language without revealing anything beyond that fact. In the perfect variant, everything the verifier sees can be reproduced exactly by an efficient simulator that never sees the witness; soundness holds only against efficient provers, which is what "argument"…

26 thms3 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: Shuze Chen

Dynamic Approximate Text IndexingResearch Paper

A text index preprocesses a text TTT so that, given a pattern PPP of length mmm, the occurrences of PPP in TTT can be found in time close to mmm rather than to ∣T∣|T|∣T∣. Suffix trees and suffix arrays do this for exact matching. Many applications, most prominently read alignment in bioinformatics, need approximate occurrences, where a small number kkk of differences is…

19 thms3 active usersReviewed
Complexity TheorycryptographyQuantum Information·Captain: iris

Structured Quantum Hardness from Unstructured AssumptionsResearch Paper

Bennett and Gill asked in 1981 whether PO≠NPO∩coNPO\mathsf P^O\neq\mathsf{NP}^O\cap\mathsf{coNP}^OPO=NPO∩coNPO with probability 1 over a uniformly random oracle OOO. A random oracle supplies computational difficulty without algebraic structure, so such a separation is evidence that hardness in NP∩coNP\mathsf{NP}\cap\mathsf{coNP}NP∩coNP need not rest on special properties of an explicit…

41 thms3 active usersReviewed
ProbabilityQuantum InformationRandom Matrix Theory·Captain: iris

Random quantum circuits beyond moment matchingResearch Paper

Random quantum circuits are the workhorse of quantum supremacy experiments, benchmarking and pseudorandomness. In a sampling experiment a unitary UUU on NNN basis states (N=2nN = 2^nN=2n for nnn qubits) is applied to a fixed input and the outcome is measured; the relevant statistics are the output probabilities ∣⟨x∣U∣y⟩∣2|\langle x|U|y\rangle|^2∣⟨x∣U∣y⟩∣2. For a Haar random UUU a single…

39 thms3 active usersReviewed
Complexity TheoryOptimizationProbability+1·Captain: Shuze Chen

Sharp Power Loss Thresholds for Vector Min UncutResearch Paper

Vector Min Uncut asks for unit vectors, one per vertex of a weighted graph, such that the endpoints of every heavy edge are nearly antipodal. At rank one the vectors are signs ±1\pm1±1 and the problem is classical Min Uncut, the complement of Max-Cut, for which Agarwal, Charikar, Makarychev and Makarychev gave an O(log⁡∣V∣)O(\sqrt{\log |V|})O(log∣V∣​)-approximation (STOC 2005).…

22 thms3 active usersReviewed
CombinatoricsGraph TheoryProbability·Captain: Shuze Chen

Hitting time for loose Hamilton cycles in the random hypergraph processResearch Paper

Hitting-time theorems are among the sharpest statements in the theory of random graphs. Instead of asking at which edge density a property appears, they ask whether it appears at the exact moment the obvious local obstruction disappears. For graphs, Ajtai, Komlós and Szemerédi and, independently, Bollobás proved in 1984–85 that the random graph process…

21 thms3 active usersReviewed
Operations ResearchOptimizationTheoretical Computer Science·Captain: Shuze Chen

A Unified Framework for Parameterized Approximation of Clustering Objectives via Distance MappingsResearch Paper

Center-based clustering asks for kkk centers in a metric space that serve a finite set of data points well. The classical objectives (k-median, k-means, k-center, min-sum of radii) and their variants with fault tolerance, capacities, penalties or outliers have mostly been studied one at a time, each with its own algorithm. In structured metrics (bounded…

16 thms3 active usersReviewed
CombinatoricsMarkov ChainProbability+1·Captain: Shuze Chen

Fast Almost-Uniform Sampling of Random kkk-SAT SolutionsResearch Paper

A random kkk-SAT formula with nnn variables and m=⌊αn⌋m=\lfloor\alpha n\rfloorm=⌊αn⌋ clauses is the standard model of a typical constraint satisfaction instance. Below the satisfiability threshold, which is near 2kln⁡22^k\ln 22kln2 clauses per variable, such a formula has exponentially many solutions. Sampling one of them almost uniformly is a basic algorithmic task: it gives…

27 thms3 active usersReviewed
Algorithmic Game TheoryOptimizationProbability+1·Captain: Shuze Chen

Correlated Forest Rounding for Unweighted Nash Social WelfareResearch Paper

In the Nash social welfare (NSW) problem, mmm indivisible items are divided among nnn agents with valuations vi:2M→R≥0v_i:2^M\to\mathbb R_{\ge0}vi​:2M→R≥0​, and the goal is to maximize the geometric mean (∏ivi(Si))1/n\big(\prod_i v_i(S_i)\big)^{1/n}(∏i​vi​(Si​))1/n of the agents' values. The objective sits between utilitarian welfare and max-min fairness and is invariant under rescaling any single valuation,…

16 thms3 active usersReviewed
Algebraic TopologyCombinatoricsComplexity Theory+2·Captain: Shuze Chen

Polynomial Swap Coboundary Expansion with Applications to LTCs and PCPsResearch Paper

Agreement tests, locally testable codes and probabilistically checkable proofs share one step: local functions that agree on most overlaps must be stitched into one global function. On high-dimensional expanders this step is controlled by swap coboundary expansion. That notion asks the faces complex of a simplicial complex to be a coboundary expander with…

29 thms3 active usersReviewed
Graph TheoryMachine LearningProbability+1·Captain: Shuze Chen

Supervised Learning with Hidden CorrespondencesResearch Paper

In many data sets the correspondence between inputs and labels is lost or only partly known: records are linked across databases without a shared identifier, labels are released only in aggregate over bags of examples, or a privacy mechanism shuffles them. The learner then sees inputs X1,…,XnX_1,\dots,X_nX1​,…,Xn​ and labels Y1,…,YnY_1,\dots,Y_nY1​,…,Yn​ together with a graph of plausible…

24 thms3 active usersReviewed
Algorithmic Game TheoryComputational ComplexityTheoretical Computer Science·Captain: Shuze Chen

Settling the Complexity of Hylland–Zeckhauser EquilibriaResearch Paper

Assigning dormitory rooms to students or shifts to workers is a one-sided matching market: nnn agents must share nnn indivisible goods, each agent receives exactly one good, and money cannot change hands. Randomization restores fairness when several agents want the same good: a random assignment gives each agent a probability of receiving each good, and by the…

29 thms3 active usersReviewed
Linear algebraMachine LearningProbability+1·Captain: Shuze Chen

Nearly Optimal Strong Coresets for ℓp\ell_pℓp​ Subspace ApproximationResearch Paper

Low-rank approximation under robust losses is a basic primitive of data analysis. Given nnn points in Rd\mathbb R^dRd, the ℓp subspace approximation problem asks for a subspace of dimension at most kkk minimizing the sum of ppp-th powers of the Euclidean distances of the points to it. For p=2p=2p=2 this is principal component analysis; for 1≤p<21\le p<21≤p<2 it is less sensitive to…

24 thms3 active usersReviewed
CombinatoricsGraph TheoryLinear algebra+2·Captain: Shuze Chen

Breaking the Quadratic Time Barrier for Flow Sparsifiers via Schur Complement LocalizationResearch Paper

Many multicommodity flow and cut problems only concern a small set of terminals inside a large network. Vertex sparsification replaces the network by a graph on the terminals alone that preserves, up to a factor called the quality, how well every pattern of terminal traffic can be routed. Such a graph is a preprocessing step for approximation algorithms…

19 thms3 active usersReviewed
Convex OptimizationGraph TheoryProbability+1·Captain: Shuze Chen

Polynomial-Time Differentially Private Synthetic Graph Release with Nearly-Linear Additive ErrorResearch Paper

Releasing a weighted graph under edge-level differential privacy is a basic task in private data analysis: the vertex set is public, the weight of every pair of vertices is private, and a released synthetic graph should preserve the answers to a rich family of queries. Cut queries are the canonical family, because many graph optimization problems (Max-Cut,…

23 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research+1·Captain: Shuze Chen

Stratifying Markets for Efficient TradeResearch Paper

In bilateral trade a seller owns one item and a buyer wants it; each knows only their own cost or value. Myerson and Satterthwaite (1983) showed that no incentive-compatible, individually rational, budget-balanced mechanism trades efficiently whenever the supports of the value and the cost overlap, so the question becomes which simple mechanisms capture a…

30 thms3 active usersReviewed
Algorithmic Game TheoryOperations ResearchOptimization+1·Captain: Shuze Chen

Efficient Equilibrium Computation in Colonel Blotto GamesResearch Paper

The Colonel Blotto game (Borel, 1921) is the basic model of competitive resource allocation: two players divide fixed budgets among several contests, and each contest goes to the larger allocation. It models military and security planning, elections and R&D races. In the continuous version, allocations are arbitrary nonnegative reals, so each player has a…

29 thms3 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: Shuze Chen

Pattern Matching with Edits in O~(n+k3⋅n/m)\tilde{O}(n+k^3 \cdot n/m)O~(n+k3⋅n/m) TimeResearch Paper

Finding the positions where a pattern occurs in a text with a few typos is one of the basic tasks on strings, used for example in read mapping in computational biology. With the edit distance ed(X,Y)\mathrm{ed}(X,Y)ed(X,Y) (the minimum number of single-character insertions, deletions and substitutions turning XXX into YYY) the task is pattern matching with edits: given a…

25 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryLinear algebra+1·Captain: Shuze Chen

A Sharp Rigidity Law for Effective ResistanceResearch Paper

Effective resistances summarize a weighted graph as an electrical network: the resistance RuvR_{uv}Ruv​ between two vertices is the voltage needed to send one unit of current from uuu to vvv. They govern commute times and are the sampling probabilities of spectral sparsification (Spielman–Srivastava 2011), and they form a metric on the vertices.

10 thms3 active usersReviewed
Complexity TheoryMachine LearningNumerical Analysis+1·Captain: Shuze Chen

The Cancellation-Free Cost of Hessian Diagonals: Exact Counts, Formulas and InterfacesResearch Paper

Automatic differentiation computes the gradient of a function given as a program at a constant factor over one evaluation [Baur and Strassen 1983; Griewank and Walther 2008]. Second-order quantities are harder. The Hessian diagonal (∂2f/∂xi2)i(\partial^2 f/\partial x_i^2)_i(∂2f/∂xi2​)i​ and its sum, the Laplacian, appear in physics-informed neural networks, variational Monte Carlo…

15 thms3 active usersReviewed
Complexity TheorycryptographyQuantum Information+1·Captain: iris

Natural proofs for quantum state preparation lower boundsResearch Paper

Proving that a specific quantum state needs large circuits to prepare is one of the central open tasks of quantum complexity theory. In classical circuit complexity, Razborov and Rudich showed that a broad class of lower-bound techniques, natural proofs, cannot separate circuit classes that can compute pseudorandom functions (Razborov–Rudich 1997). Li and…

39 thms3 active usersReviewed
PreviousPage 12 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