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

51–75 of 1496
Open1378Completed118All1496
🏆Completed
Graph TheoryMarkov ChainProbability·Captain: mikedeng1

Large independent sets via neighborhood block dynamics, Glauber dynamics, and local occupancyResearch Paper

An independent set is a collection of vertices containing no adjacent pair. Large independent sets are a central object in extremal graph theory and graph algorithms. A graph with maximum degree Δ always has an independent set of size at least n/(Δ+1), where n is its number of vertices. Restrictions on the edges inside neighborhoods can improve this scale…

27 thms5 active usersReviewed
Algebraic GeometryComplexity TheoryTheoretical Computer Science·Captain: mikedeng1

Approximate Polynomial Satisfiability and Integral Closure Membership in the Counting HierarchyResearch Paper

Polynomial maps describe families of algebraic objects through their parameters. Exact image membership asks whether some parameter choice produces a specified object. Membership in the image's closure also permits objects obtained only as limits. This distinction occurs in tensor border rank and in closures of group orbits, applications stated in Corollary…

65 thms5 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Moment Ambiguity and the Limits of Robust Stochastic OptimizationResearch Paper

An online decision maker often receives a summary of uncertain inputs before seeing their realized values. The secretary problem isolates one consequence of incomplete information: items arrive one at a time, and a rejected item cannot be recalled. The objective is to select a largest item. The question here is how much the entire sequence of exact moments…

32 thms5 active usersReviewed
CombinatoricsConvex Optimization·Captain: mikedeng1

A deterministic (1+ε)n(1+\varepsilon)^n(1+ε)n approximation for the permanent of a nonnegative matrixResearch Paper

The permanent measures the total weight of ways to pair every row of a square matrix with a distinct column. For a zero-one matrix it counts perfect matchings in a bipartite graph. For general nonnegative entries it retains their weights. Counting problems use this quantity to distinguish the existence of a configuration from the total contribution of all…

31 thms5 active usersReviewed
Computational ComplexityMarkov ChainProbability·Captain: mikedeng1

How Hard Is It to Compute Cover Time?Research Paper

A cover time measures how long a random walk takes to visit every vertex of a graph. Its expectation distinguishes graphs that are explored quickly from graphs where some vertices remain unseen for much longer. Exact computation records information beyond a coarse estimate of exploration speed. The specified-start comparison problem asks whether the…

26 thms5 active usersReviewed
CombinatoricsOperations Research·Captain: mikedeng1

Kawamura's pinwheel density conjecture holds for smallest period at most five and fails from sixResearch Paper

A pinwheel instance asks whether a single machine, doing one task per day, can visit each task often enough that task iii occurs in every window of aia_iai​ consecutive days. The problem models periodic servicing such as the perpetual maintenance of machines (arXiv:2202.01567), and its central question is how much of the machine's capacity can be promised in…

959 thms5 active usersReviewed
Complexity TheoryConvex OptimizationProbability·Captain: mikedeng1

A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle ModelResearch Paper

A membership oracle answers whether a specified point belongs to an unknown set. It supplies one Boolean answer per query, even when the point has arbitrary real coordinates. In convex optimization this is a basic way to describe a feasible region without giving its inequalities. The question is how many such answers an algorithm needs before it can…

24 thms5 active usersReviewed
Complexity TheoryInformation TheoryTheoretical Computer Science·Captain: mikedeng1

The Exact Communication Threshold for Parallel RepetitionResearch Paper

A two-player game gives Alice and Bob related questions and asks them to produce a valid pair of answers. Each player initially sees only their own question. Such games model the separated verifiers and answer constraints used in complexity theory. Repeating a game independently is useful when simultaneous success becomes unlikely. The question addressed…

22 thms5 active usersReviewed
ProbabilityQuantum Information·Captain: mikedeng1

Sublinear Copies Suffice for Fidelity Estimation with Pauli MeasurementsResearch Paper

A quantum experiment prepares a state, but its intended mathematical description does not certify what the apparatus actually produced. Reconstructing the entire state can require substantially more data than estimating one specified property. Fidelity estimation asks how closely an unknown preparation matches a known pure target. This mission also includes…

25 thms5 active usersReviewed
Computational ComplexityQuantum Information·Captain: mikedeng1

Exponential Quantum Advantage in Testing Fourier DimensionalityResearch Paper

A central question in quantum query complexity is how large a gap can separate quantum and classical query counts for a natural property that is classically testable independently of the input length. Simon's problem and Forrelation give exponential gaps, but neither is such a property. Chen (2026) proposes Fourier dimension testing as a candidate: a…

24 thms5 active usersReviewed
Machine LearningQuantum Information·Captain: iris

Efficient Agnostic Learning of Tensor Network StatesResearch Paper

Quantum state tomography asks for a classical description of an unknown quantum state from measurements on independent copies of it. For general states on nnn subsystems the number of copies grows exponentially in nnn (O'Donnell–Wright 2016; Haah et al. 2017), so efficient reconstruction must exploit structure. Tensor network states — matrix product states…

90 thms5 active usersReviewed
Machine LearningOperations ResearchOptimization+1·Captain: iris

Computational Complexity of Data-Driven Configuration for Integer Programming, Clustering, and Learning AlgorithmsResearch Paper

Integer programming solvers expose parameters, and in practice they are run on many instances of one application. Data-driven algorithm configuration asks for parameters that perform well on a training set of instances. For cutting planes, Balcan, Prasad, Sandholm and Vitercik (2021) bound the sample complexity of tuning Chvátal–Gomory cuts: how many…

55 thms5 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryLinear algebra+1·Captain: iris

A Cheeger Inequality for Hypergraphs and Its ApplicationsResearch Paper

The conductance of a graph measures its worst bottleneck: the smallest ratio of the weight crossing a cut to the volume of the smaller side. Cheeger's inequality for graphs, proved by Alon and Milman (JCTB 1985) and Alon (Combinatorica 1986), bounds conductance on both sides by an eigenvalue. Since an eigenvalue is computable and a minimum over cuts is not…

18 thms5 active usersReviewed
Mathematical PhysicsProbabilityQuantum Information+1·Captain: iris

Sharp Bounds on Ground State Energy of the SYK ModelResearch Paper

The Sachdev–Ye–Kitaev (SYK) model is a random Hamiltonian on nnn Majorana fermions with all-to-all kkk-body interactions (Sachdev–Ye 1993; Kitaev 2015; Maldacena–Stanford 2016). It is studied in high-energy physics as a solvable model of quantum chaos and holography, and in quantum computing as a candidate for a quantum advantage in ground-state preparation:…

37 thms5 active usersReviewed
Complexity TheoryQuantum InformationTheoretical Computer Science·Captain: iris

A Dichotomy for Exact Quantum Circuit AmplitudesResearch Paper

Which quantum circuits can a classical computer simulate exactly? The Gottesman–Knill theorem shows that Clifford circuits can be simulated by tracking stabilizer generators (Aaronson–Gottesman 2004); Valiant's matchgates give a second mechanism, and bounded Schmidt rank a third. In 2005 Aaronson asked whether these simulation algorithms have a common…

43 thms5 active usersReviewed
Complexity TheoryGraph TheoryMathematical Logic·Captain: iris

A Uniform Algorithm for Strict NP on Bounded-Treedepth StructuresResearch Paper

Strict NP (SNP) is the class of properties of finite structures expressible as ∃R1…Rr ∀x1…xk ψ\exists R_1\dots R_r\,\forall x_1\dots x_k\,\psi∃R1​…Rr​∀x1​…xk​ψ with ψ\psiψ quantifier-free. It contains many graph-layout and colouring problems: deciding whether the stack number, queue number or track number of a graph is at most kkk, whether its twin-width is at most kkk, or whether it is ccc-colour…

31 thms5 active usersReviewed
Convex OptimizationMarkov ChainProbability+1·Captain: iris

Polytope Sampling at the Speed of IsoperimetryResearch Paper

Drawing a point uniformly at random from a polytope X={x∈Rn:Ax<b}\mathcal X=\{x\in\mathbb R^n: Ax<b\}X={x∈Rn:Ax<b} given by mmm linear inequalities is a basic primitive of high-dimensional computation. It is the inner loop of randomized volume computation and integration over convex sets, and it is used directly in systems biology (sampling flux polytopes of metabolic networks),…

35 thms5 active usersReviewed
AnalysisHarmonic AnalysisMathematical Physics+1·Captain: iris

Sensing frequencies at the discrete Grover-Heisenberg limit using a single qubitResearch Paper

Quantum sensing uses a controlled quantum system to detect weak fields. In AC magnetometry a single qubit, such as a nitrogen-vacancy centre in diamond, feels a field Bcos⁡(ωt+ϕ)B\cos(\omega t+\phi)Bcos(ωt+ϕ) along its ZZZ axis. A conventional protocol needs evolution time Θ(1/B)\Theta(1/B)Θ(1/B) per candidate frequency, so scanning NNN candidates costs Θ(N/B)\Theta(N/B)Θ(N/B). Allen et al. ([AMC+25])…

23 thms5 active usersReviewed
CombinatoricsComplexity TheoryGraph Theory·Captain: iris

From One Hidden Subgraph to Dense Graph Partitions with Applications to Hardness of ClusteringResearch Paper

Many hardness-of-approximation results for partitioning problems start from a problem about one hidden object and must produce an instance in which a whole partition of good parts exists. Graph Coloring asks to partition a graph into independent sets; Densest-qqq-Partition and min-sum clustering ask to partition a vertex set into dense parts. The classical…

30 thms5 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

Short Non-Interactive Proofs for Time-Space ComputationsResearch Paper

An interactive proof lets a slow prover convince a fast verifier. Merlin–Arthur (MA) protocols remove the interaction: the prover sends one message, and the verifier tosses coins and decides. For circuit satisfiability and related problems, a line of work gives MA protocols that run faster than the known algorithms, starting from Williams, 2016, who gave a …

55 thms5 active usersReviewed
CombinatoricsDiscrete GeometryProbability+1·Captain: iris

Robust Exact Realization of Pairwise Boolean StatisticsResearch Paper

Suppose a data set consists of distinct binary rows of length nnn. Its basic statistics are the number of rows, each column sum, and each pairwise co-occurrence count. Given integer values for these statistics, can a set of rows be constructed that realizes them exactly? Equivalently: given the degree-at-most-two statistics of a Boolean function, construct a…

25 thms5 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

Deterministic Parameterized Inapproximability of the Shortest Vector and Minimum Distance ProblemsResearch Paper

The Shortest Vector Problem (SVP) asks for a shortest nonzero vector of an integer lattice. It is the basic computational problem of lattice-based cryptography and of the geometry of numbers. In the parameterized setting the natural parameter is the distance threshold ddd: exhaustive search over integer vectors with at most dpd^pdp nonzero coordinates solves SVP…

33 thms5 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

Recursive Call-Count Sequences: Structural Realisability, Periodic Branching, and Partial-Observation ReconstructionResearch Paper

A terminating recursive procedure that calls itself twice on smaller inputs has a call-count sequence CnC_nCn​: the number of invocations made on input nnn, root call included. Naive Fibonacci recursion is the standard example, with C0=C1=1C_0=C_1=1C0​=C1​=1 and Cn=1+Cn−1+Cn−2C_n=1+C_{n-1}+C_{n-2}Cn​=1+Cn−1​+Cn−2​, so Cn=2Fn+1−1C_n=2F_{n+1}-1Cn​=2Fn+1​−1. The forward problem, computing costs from a recursive specification, is…

50 thms5 active usersReviewed
AlgebraCombinatoricsComplexity Theory+1·Captain: iris

Conservative Modular Counting at Every Odd PrimeResearch Paper

A constraint satisfaction problem over a fixed finite relational template H=(D;R1,…,Rs)H=(D;R_1,\dots,R_s)H=(D;R1​,…,Rs​) asks about assignments of values in DDD to variables subject to constraints Ri(v1,…,vk)R_i(v_1,\dots,v_k)Ri​(v1​,…,vk​). Counting the satisfying assignments exactly is the subject of the Dyer–Richerby dichotomy (DR): for every template it is either in FP or #P-complete, and the tractable…

31 thms5 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

d-DNNF is Not Polynomially Closed Under NegationResearch Paper

Deterministic decomposable negation normal form circuits (d-DNNFs) are a central target language of knowledge compilation: a d-DNNF supports exact model counting, weighted model counting and sampling in time polynomial in its size (Darwiche–Marquis 2002). Compiling a CNF into a d-DNNF and then counting is a standard approach to #SAT, and d-DNNFs are used…

52 thms5 active usersReviewed
PreviousPage 3 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