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.
Fractional colorings of Kr-free graphs with local demandsResearch Paper
Lower bounds on the independence number in terms of degrees are among the oldest themes of extremal graph theory. For triangle-free graphs, Ajtai, Komlós and Szemerédi proved α(G)=Ω(nlogd/d) for average degree d, and Shearer sharpened this to α(G)≥nf(d) with the explicit function f(d)=(dlogd−d+1)/(d−1)2 (Shearer 1983), later to the…
The Gap Between Average-Case and Worst-Case ComplexityResearch Paper
Impagliazzo's "five worlds" ([Imp95], Structure in Complexity Theory 1995) separate two questions that complexity theory cannot yet tell apart. Is NP hard in the worst case, and is it hard on average, for instances drawn from an efficiently samplable distribution? In the world called Heuristica, every problem in NP is easy on average, yet…
Incremental Open Addressing Has No Time-Space TradeoffResearch Paper
Open addressing is the hash-table framework behind linear probing, quadratic probing, double hashing, Robin Hood hashing and cuckoo hashing. In the incremental (insert-only) setting, keys are inserted one after another into an initially empty array of n slots until a target load factor (fraction of occupied slots) is reached. For more than half a century…
Improved Algorithms in the Random-Order Model: Knapsack, GAP, and BeyondResearch Paper
Online services allocate limited resources to requests arriving over time. Accepting a request earns value but uses capacity a later, more valuable request might have needed, and decisions cannot be revised. The simplest such model is online knapsack; the generalized assignment problem (GAP) extends it to several machines on which an item may have different…
From Bilateral Trade to Matching Markets: Sharp Gains from TradeResearch Paper
In a matching market, unit-demand buyers and unit-supply sellers with privately known values and costs are connected by a compatibility graph, and a platform or market maker must decide who trades with whom and at what prices. Myerson and Satterthwaite (MS83) showed that incentive compatibility, voluntary participation and budget balance already rule out…
Tight Information-Theoretic Threshold for Decoded Quantum Interferometry with Local Quantum DecodersResearch Paper
Decoded quantum interferometry (DQI) is a quantum algorithm for sparse constraint problems such as Max-k-XORSAT: it prepares a state whose amplitudes favour good assignments by reducing optimization to the decoding of a classical linear code (Jordan et al., Nature 2025). How well DQI does is therefore governed by how well that code can be decoded from the…
Multiplying matrices via polynomials: operational asymptotic spectrum barrierResearch Paper
The exponent of matrix multiplicationωF is the least τ such that n×n matrices over a field F can be multiplied with O(nτ+o(1)) arithmetic operations; equivalently, it measures the growth of the tensor rank of the matrix multiplication tensor ⟨n,n,n⟩. In October 2026 OpenAI announced a proof that …
Precedence-Constrained Decision Trees and CoveringsResearch Paper
In the Optimal Decision Tree problem an unknown target hypothesis h∗ from a finite set H of n hypotheses must be identified by adaptively performing tests from a family T of m tests; each test partitions H and its reply reveals the block that contains h∗. The problem goes back to Garey and Graham (1974) and appears in medical diagnosis, troubleshooting…
Otter: A Provably MEV-Resilient Automated Market Maker via Surplus RedistributionResearch Paper
An automated market maker (AMM) is a smart contract that holds reserves of two tokens X and Y and trades with anyone along a fixed pricing curve. On a blockchain the trades of one block are sequenced by a builder, who may also insert trades of its own. Ordering power yields maximal extractable value (MEV): in a sandwich attack the builder buys before a…
Inside the Critical Window of Random 2-SATResearch Paper
Random 2-SAT is the one case of random k-SAT whose satisfiability threshold and scaling window are both known. With n Boolean variables and m random 2-clauses, a formula is satisfiable with probability tending to one when m/n<1 and unsatisfiable with probability tending to one when m/n>1, a result proved independently by Chvátal and Reed (FOCS 1992), Goerdt…
Better Bounds for Semi-Streaming Maximum Matching via Load BalancingResearch Paper
Graphs too large to store are often processed as a stream: the edges arrive one at a time, in an order nobody controls, and an algorithm may read the stream a few times (passes) while keeping only a small summary in memory. The semi-streaming model of Feigenbaum, Kannan, McGregor, Suri and Zhang (FKM+05) allows O~(n)=O(n⋅polylogn) bits…
Eliminating Ongoing Interaction in Long-Running Verification AgentsResearch Paper
A long-running verification agent completes a chain of tasks, each of which must be submitted exactly, and it can consult a human expert along the way. Every consultation is paid, and every experiment the agent runs on its own tools is paid. A basic design question is whether the expert must stay available throughout the run, answering questions as they…
In online bipartite matching, m offline vertices are known in advance and online vertices arrive one at a time, each revealing its neighbourhood; every arrival must be rejected or irrevocably matched to an unmatched neighbour, and the goal is a large matching. Under adversarial arrivals the Ranking algorithm of Karp, Vazirani and Vazirani is optimal with…
Low Soundness Linearity Testing on Subsets of the HypercubeResearch Paper
A linearity test reads a function f:F2n→F2 at a few random points and accepts or rejects. It is perfectly complete if it always accepts linear functions. It has low soundness if, whenever it accepts with probability at least (1+δ)/2, f agrees with an affine function on at least a (1+s(δ))/2 fraction of inputs, with s(δ)>0…
The Price of Anarchy in Markets for LemonsResearch Paper
Trade in a market for lemons can fail even when trade is efficient: when the seller knows more than the buyer about the quality of the good, a price at which the seller is willing to sell signals bad news to the buyer, and adverse selection can unravel the market (Akerlof 1970). Securities markets, used-asset markets and insurance all share this structure.…
Random tensor isomorphism under orthogonal and unitary actions: Smoothed and average-case analysisResearch Paper
Two 3-tensors A,B∈Cn×n×n are unitarily isomorphic when a change of orthonormal basis in each of the three modes turns one into the other. Deciding this, and its robust version (is B close to some basis change of A?), is the tensor analogue of comparing two matrices up to unitary equivalence. It arises in quantum information, where a…
Finding Hypercliques Faster Than Brute ForceResearch Paper
A hypergraph is a collection of subsets of a vertex set, called edges. In a (k−1)-uniform hypergraph, every edge contains exactly k−1 vertices. A k-hyperclique consists of k vertices for which every (k−1)-subset is an edge. Checking each possible selection gives a running time of order nk. The algebraic question behind this mission asks whether the…
Estimating a Transition Point from Gibbs and Ground StatesResearch Paper
Learning a phase transition from a finite quantum system involves two independent choices: how many state copies to observe and how large a system each copy contains. A transition is defined by an infinite-volume limit, whereas every available density matrix belongs to a finite cube with a specified boundary. More copies refine information about that finite…
Multi-Party Error Resilience beyond n1Research Paper
An information dissemination task asks every participant in a communication network to learn every participant's input. This is a useful benchmark for adversarial communication: once a participant knows the full input vector, it can evaluate any specified function of those inputs locally. The distinction between learning all inputs and learning only the…
Small classes have linear neighbourhood complexityResearch Paper
A graph class can be studied by counting how many of its graphs exist on a fixed set of labels. It can also be studied by counting the different adjacency patterns visible on a chosen vertex set inside one graph. These are different measurements: the first concerns a collection of whole graphs, while the second concerns local observations within an…
Fine-Grained Proof Complexity for Elementary Arithmetic in Extended FregeResearch Paper
Extended Frege (EF) is the propositional proof system obtained from the textbook Frege system by adding the extension rule, which names a fresh variable as an abbreviation of a short formula (Cook–Reckhow 1979). Recent cryptographic constructions rely on EF proofs of correctness of concrete circuits, and the efficiency of those constructions is governed by…
Byzantine Partition Detection Under ChurnResearch Paper
Byzantine fault-tolerant protocols are proved correct under two separate assumptions: a bound t on the number of faulty processes, and enough vertex connectivity in the communication network (classically, connectivity above a multiple of t). The second assumption is usually taken for granted. Sengupta and Perrin ask whether the participants themselves can…
Optimal Semi-Honest Information-Theoretic Secure Multi-Party Computation with Servers and ErasuresResearch Paper
Secure multi-party computation lets parties compute a joint function of private inputs while revealing nothing beyond the output. In the client–server setting, a few clients with inputs delegate the work to n servers that have no inputs, and an adversary may corrupt one client and a fraction α of the servers. Oblivious transfer (OT) is the basic…
Near-Optimal One-Way Functions, Direct Product Hardness and Hash Functions from iO and NP versus coNPResearch Paper
A one-way function is an efficiently computable function f:{0,1}n→{0,1}m that no efficient algorithm can invert on a random image: given y=f(x) for uniform x, it is hard to find any x′ with f(x′)=y. One-way functions are the minimal assumption of private-key cryptography, and their quantitative strength, the best inversion probability an…
Pairwise Exchanges of Freely Replicable Goods with Negative ExternalitiesResearch Paper
Datasets, software and patents are freely replicable: giving a copy costs the giver nothing directly. Firms that hold such goods are often competitors, so each one gains from acquiring a good and loses when a rival acquires one. Data consortia and patent pools face this tension: every member wants access to the others' goods, and no member wants its rivals…