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.

1378 open missions

Missions

51–75 of 1378
Open1378Completed118All1496
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
Complexity TheoryGraph TheoryTheoretical Computer Science·Captain: iris

Improved NP-Hardness of Approximation for Max-3-Cut and for Max-k-Cut with Small kResearch Paper

In Max-kkk-Cut one is given a graph with non-negative edge weights and must colour its vertices with kkk colours so as to maximise the total weight of the edges whose endpoints receive different colours. For k=2k = 2k=2 this is Max-Cut. For k≥3k \ge 3k≥3 the best polynomial-time algorithms round the semidefinite relaxation of Frieze and Jerrum (Algorithmica 1997); for k=3k = 3k=3…

54 thms5 active usersReviewed
Quantum InformationTheoretical Computer Science·Captain: iris

On the pseudorandomness of simple quantum processesResearch Paper

A pseudorandom unitary ensemble is one that no efficient quantum algorithm can tell apart from the Haar measure. Such ensembles underlie quantum cryptography and are used as models of chaotic many-body dynamics. A weaker, purely statistical property is being an approximate unitary ttt-design: the ensemble reproduces the first ttt moments of the Haar measure.…

47 thms5 active usersReviewed
Algorithmic Game TheoryOperations Research·Captain: iris

An O(loglogn) Upper Bound on the Price of Stability for Undirected Multicast Shapley GamesResearch Paper

In a network design game each user must connect a source to a destination in a shared network, and the cost of every link that is built is split among the users who route through it. A central planner would pick the routing of least total cost; the users instead pick routes that minimize their own payment, and the two goals can disagree. The price of…

31 thms5 active usersReviewed
Convex OptimizationLinear algebraOptimization+1·Captain: iris

A Fast Lewis-weight Interior-Point Method for Linear Optimization over Product Convex SetsResearch Paper

Many problems in statistics, control and data science minimize a linear objective over a product of small convex sets subject to a few linear equations: ℓp\ell_pℓp​ regression, entropy-regularized transport, and second-order cone programs with small cones. When the number of variables nnn is much larger than the number of equations ddd, the running time in terms of ddd…

27 thms5 active usersReviewed
Complexity TheoryOperations ResearchProbability·Captain: iris

Impatience Makes Matching NP-HardResearch Paper

Ride-hailing platforms, online labour marketplaces, organ-allocation systems and quantum switches all match two sides of a market whose agents do not wait forever. The standard abstraction is a bipartite queueing system: agents of finitely many types arrive over time, the platform decides which compatible pairs to match, and an unmatched agent leaves when…

32 thms5 active usersReviewed
Complexity TheoryGraph TheoryOperations Research+1·Captain: iris

Approximation and Hardness for the Data Validation ProblemResearch Paper

Precedence-constrained scheduling takes a partial order on tasks as input, yet in practice the order is rarely known with full confidence. In product design, assembly, project scheduling and construction, the relation between two tasks is often not documented, and an expert must be consulted to determine it. For automotive assembly, probing direct…

36 thms5 active usersReviewed
Convex OptimizationLinear algebraOptimization+1·Captain: iris

Adaptive Matrix Sparsification with Applications to Empirical Risk Minimization and Computational GeometryResearch Paper

Empirical risk minimization (ERM) is a convex optimization problem that covers linear and ℓp\ell_pℓp​ regression, LASSO, logistic regression, support vector machines and quantile regression. Its dual form is

28 thms5 active usersReviewed
Complexity TheoryConvex OptimizationTheoretical Computer Science·Captain: iris

Near-Quadratic Lower Bounds for Convex Optimization with Binary First-Order QueriesResearch Paper

Classical oracle complexity counts how many exact first-order answers — a value f(y)f(y)f(y) and a subgradient g∈∂f(y)g\in\partial f(y)g∈∂f(y) — a method needs to minimize a convex function. With exact real answers, O(dlog⁡(MR/ε))O(d\log(MR/\varepsilon))O(dlog(MR/ε)) queries suffice in dimension ddd, attained by the center of gravity method and by modern cutting-plane methods. A computer, however, reads…

62 thms5 active usersReviewed
CombinatoricsComplexity TheoryOperations Research·Captain: iris

Additive Ω(log⁡∗OPT)\Omega(\log^* OPT)Ω(log∗OPT) Gap for Bin Packing with Three Items per BinResearch Paper

In bin packing, items with sizes in (0,1](0,1](0,1] must be partitioned into bins of total size at most one, using as few bins as possible; OPT(I)\mathrm{OPT}(I)OPT(I) is that minimum. The problem is strongly NP-hard even in the 3-partition regime, where every size lies in (1/4,1/2)(1/4,1/2)(1/4,1/2) and a bin holds at most three items, so research has concentrated on additive guarantees …

28 thms5 active usersReviewed
Bandit AlgorithmsGraph TheoryMachine Learning·Captain: iris

The Price of Partial Information with Switching Costs: A Complete Characterization for Feedback GraphsResearch Paper

Online learning algorithms randomize to hedge against an adversary, and independent resampling makes them change action often. When changing a route, a deployed model or a treatment has a cost of its own, the right benchmark charges one unit per change. With full information this charge leaves the minimax regret at order Tlog⁡K\sqrt{T\log K}TlogK​ (Kalai and Vempala,…

40 thms5 active usersReviewed
Information TheoryStatisticsTheoretical Computer Science·Captain: iris

Testing Fairness of Evolving Software under UncertaintyResearch Paper

Fairness testing checks that a program treats comparable inputs comparably, for instance that two inputs differing only in a protected attribute receive the same favourable outcome with nearly the same probability (Galhotra, Brun, Meliou 2017). Deployed software changes: a program P0P_0P0​ that has already been certified is replaced by a patched program P1P_1P1​, and…

42 thms4 active usersReviewed
Machine LearningProbabilityTheoretical Computer Science·Captain: iris

Learning to Think from Multiple Thinkers: How Chain-of-Thought Heterogeneity Affects Efficient LearnabilityResearch Paper

Language models are trained to imitate chains of thought (CoTs), the intermediate tokens a reasoner writes before its answer. A learning-theoretic framework for this was introduced by Joshi, Vardi, Block, Goel, Li, Misiakiewicz and Srebro (COLT 2025, PMLR pp. 3161–3212, cited as [JVB+25] in the paper). In that framework, CoTs generated by a single…

31 thms4 active usersReviewed
Machine LearningOperations ResearchReinforcement Learning·Captain: iris

Regret-based Characterization, Information Limits, and the Sample Complexity of Auditing Adaptive PoliciesResearch Paper

Adaptive policies — recommendation systems, dynamic pricing rules, treatment protocols, trading strategies — choose actions based on the state they observe. A natural audit question is how much of a policy's performance comes from that adaptivity, as opposed to the average mix of actions it plays. Answering it requires a benchmark that plays the same…

20 thms4 active usersReviewed
Machine LearningQuantum Information·Captain: mikedeng1

Agnostic proper learning of stabilizer states from Pauli measurementsResearch Paper

A quantum experiment consumes copies of an unknown state to obtain classical observations. When the observables of interest commute, several outcomes can be obtained from one copy. This matters for predicting outcomes of Pauli measurements and for evaluating sums of Pauli terms in quantum algorithms. A prediction task asks for more than estimating one…

33 thms4 active usersReviewed
cryptographyQuantum InformationTheoretical Computer Science·Captain: iris

Classical Verification of Quantum Sampling with Negligible ErrorResearch Paper

A quantum computer that is asked for a sample from the output distribution of a circuit returns a string, and nothing in that string shows whether the circuit was actually run. Classical verification of quantum sampling asks for an interactive protocol in which a fully classical, polynomial-time verifier talks to an untrusted quantum prover and outputs…

35 thms4 active usersReviewed
cryptographyQuantum Information·Captain: mikedeng1

EFI⇔1PRS\mathsf{EFI}\Leftrightarrow\mathsf{1PRS}EFI⇔1PRSResearch Paper

A cryptographic primitive can hide a classical choice, describe apparent randomness, or express the difficulty of recovering a secret key. Establishing that such tasks require the same computational assumption helps identify which assumptions a larger protocol actually needs. This mission concerns two quantum primitives: EFI pairs, which hide a choice…

35 thms4 active usersReviewed
Computational ComplexityQuantum Information·Captain: mikedeng1

Quantum Tolerant Testing of Fourier Dimensionality and JuntasResearch Paper

Tolerant property testing asks whether an unknown function, available only through queries, is close to a class of functions or far from it. Standard testing accepts every function in the class and rejects inputs at distance at least a specified threshold. Tolerant testing requires that inputs at distance at most ε1\varepsilon_1ε1​ be accepted and inputs at…

34 thms4 active usersReviewed
PreviousPage 3 of 56Next

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