Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Theoretical Computer Science

1,446 missions · 603 completed

The mathematical foundations of computation: which problems can be solved, by what algorithms, and at what cost in time, space, or communication. Distinguished by its emphasis on rigor and unconditional lower bounds, it spans computational complexity, algorithm design, automata and computability, cryptography, and the analysis of Boolean functions.

Missions

Open843Completed603All1446
CombinatoricsComplexity TheoryGraph Theory·Captain: iris

NP-hardness for Bipartite Colorings up to the Maximum DegreeResearch Paper

Counting the proper qqq-colorings of a graph of maximum degree Δ\DeltaΔ is the central test case of approximate counting. Since Jerrum (1995) it has been conjectured that an FPRAS exists for general graphs whenever q≥Δ+1q\ge\Delta+1q≥Δ+1, and the rapid-mixing bounds for Glauber dynamics have moved from q>2Δq>2\Deltaq>2Δ toward that threshold. On the hardness side, Galanis,…

31 thms3 active usersReviewed
Markov ChainProbability·Captain: iris

Code Swendsen-Wang DynamicsResearch Paper

Sampling from Gibbs distributions near and below a phase transition is the hard regime for Markov chain methods, because local dynamics take exponentially long to cross energy barriers. For the Ising model the remedy is the global update of Swendsen and Wang. Quantum code Hamiltonians are the minimal models of topological phases, and Hangleiter, Ju and…

31 thms3 active usersReviewed
Algorithmic Game TheoryGraph Theory·Captain: iris

The Caccetta-Häggkvist Conjecture and Percentile Distortion: An Equivalence via Asymmetric Maximal LotteriesResearch Paper

Metric distortion measures how much a voting rule loses by seeing only ordinal preferences. Voters and candidates sit in an unknown metric space; each voter ranks candidates by distance, and the rule sees only the rankings. The distortion of a rule is the worst case, over elections and over metrics consistent with the rankings, of the ratio between the cost…

45 thms3 active usersReviewed
Complexity TheoryGraph TheoryQuantum Information·Captain: iris

Quantum Advantage in Local Certification of Graph PropertiesResearch Paper

In local certification, an untrusted prover (Merlin) assigns a certificate to every node of a network. The nodes then exchange messages with their neighbours for a fixed number of rounds and each node decides to accept or reject; the network accepts when all nodes accept. The resource measured is the certificate size per node. This model underlies…

34 thms3 active usersReviewed
Operations ResearchOptimization·Captain: iris

A Constant-Factor Approximation for Capacitated Facility Location with OutliersResearch Paper

In facility location a planner opens facilities, each with an opening cost, and assigns clients to open facilities, paying the distance as service cost. Two standard extensions model practical constraints. In capacitated facility location (CFL) each facility serves at most uiu_iui​ clients and can be opened at most once (hard capacities). In facility location…

28 thms3 active usersReviewed
AlgebraComplexity TheoryInformation Theory·Captain: iris

NP-Hardness of Bounded Distance Decoding for Reed-Solomon Codes and Variants, via Non-Archimedean RingsResearch Paper

Reed–Solomon codes are the basic family of algebraic error-correcting codes: a message is a polynomial of degree below kkk over a finite field Fq\mathbb F_qFq​, and the codeword is its list of values at nnn distinct points. For a code of rate R=k/nR=k/nR=k/n, three radii organize decoding: the unique-decoding radius (1−R)/2(1-R)/2(1−R)/2, the Johnson radius 1−R1-\sqrt R1−R​, and the covering…

26 thms3 active usersReviewed
Mathematical PhysicsQuantum Information·Captain: iris

Algorithmic Aspects of the Fermi–Hubbard ModelResearch Paper

The Fermi–Hubbard model is the standard minimal model of interacting electrons on a lattice. Each site holds up to two electrons (spin up and spin down); electrons hop between neighbouring sites with amplitude tijt_{ij}tij​, pay an energy UiU_iUi​ when two of them share a site, and feel a chemical potential μi\mu_iμi​. Its phase diagram (Mott insulators, antiferromagnetism,…

37 thms3 active usersReviewed
Complexity TheoryOptimizationQuantum Information·Captain: iris

What can be Computed with Indefinite Causal Structure?Research Paper

Quantum mechanics allows the order in which operations act to be in superposition. The process matrix formalism of Oreshkov, Costa and Brukner (OCB12) describes such situations: several laboratories each apply a local quantum operation, and a process matrix WWW fixes how their inputs and outputs are wired, without assuming a global causal order. Araújo, Feix,…

34 thms3 active usersReviewed
Complexity Theory·Captain: iris

From Succinct Arguments to Proofs: Lower Bounds for Obfuscation and SNARGsResearch Paper

Indistinguishability obfuscation (iO) and witness encryption (WE) are among the most powerful primitives in cryptography: iO implies almost every known cryptographic object, and WE lets anyone encrypt a message so that only a holder of an NP witness for a public statement can read it (Garg, Gentry, Halevi, Raykova, Sahai, Waters 2013; Garg, Gentry, Sahai,…

63 thms3 active usersReviewed
CombinatoricsGraph TheoryOperations Research·Captain: iris

Bellman-Ford in Almost-Linear TimeResearch Paper

Single-source shortest paths with real, possibly negative, arc weights is a basic subroutine of network optimization. Negative weights arise in minimum-cost flow, in reduced costs of linear programs on networks, and in difference constraints. For decades the only general algorithm was Bellman–Ford, with O(mn)O(mn)O(mn) time on nnn vertices and mmm arcs. When weights are…

27 thms3 active usersReviewed
AlgebraComplexity Theory·Captain: iris

Approximating Transcendence Degree in Medium CharacteristicResearch Paper

Deciding whether polynomials f1,…,fm∈F[x1,…,xn]f_1,\dots,f_m\in\mathbb F[x_1,\dots,x_n]f1​,…,fm​∈F[x1​,…,xn​] satisfy a polynomial relation, and computing their transcendence degree, is a basic problem in algebraic complexity theory. It underlies algebraic independence testing and rank extractors for polynomial sources (Dvir, Gabizon, Wigderson 2009), and the Jacobian is the standard tool for…

22 thms3 active usersReviewed
CombinatoricsProbability·Captain: iris

A Resolution of Friedgut's Conjecture on Influential CoalitionsResearch Paper

A coalition of coordinates of a Boolean function is influential if, after the other coordinates are drawn at random, its members can choose their own values so as to force the output. The question comes from collective coin flipping, introduced by Ben-Or and Linial (FOCS 1985): in a one-round protocol with independent uniform messages, a coalition is a set…

22 thms3 active usersReviewed
Harmonic AnalysisMachine LearningProbability+1·Captain: iris

Learning Mixtures with Unknown Scales: Sharp Dependence on SeparationResearch Paper

Finite mixture models describe a heterogeneous population as a weighted combination of component distributions. Recovering the locations, scales and weights of the components from samples is a central problem in statistics and learning theory, with a long line of work on Gaussian mixtures and other parametric families (Kalai, Moitra, Valiant 2010; Moitra,…

27 thms3 active usersReviewed
Algorithmic Game TheoryCombinatoricsOperations Research·Captain: iris

Polynomial-Time Approximate EFX for Chores via Flow and MatchingResearch Paper

Fair allocation of indivisible chores asks how to divide burdens among agents whose costs for those burdens differ. It is studied in algorithmic game theory and social choice (Aziz, Li, Moulin, Wu, 2022). The natural target is envy-freeness up to any chore (EFX): an agent's envy must disappear after any single chore is removed from her own bundle. Exact EFX…

29 thms3 active usersReviewed
Complexity TheoryProbability·Captain: iris

Tight Depth Lower Bounds for Stretch AmplificationResearch Paper

A pseudorandom generator (PRG) with stretch n↦Nn\mapsto Nn↦N is an efficiently computable function G:{0,1}n→{0,1}NG:\{0,1\}^n\to\{0,1\}^NG:{0,1}n→{0,1}N, N>nN>nN>n, whose random outputs no polynomial-time observer can tell from uniform NNN-bit strings. A generator of very small stretch n↦n+1n\mapsto n+1n↦n+1 is often considerably easier to build from a hardness assumption, while key applications need a larger…

28 thms3 active usersReviewed
CombinatoricsComplexity Theory·Captain: iris

The Contraction Lemma Beyond ETH: Algorithms and Lower BoundsResearch Paper

The Exponential Time Hypothesis of Impagliazzo and Paturi says that 3-SAT on nnn variables needs time 2Ω(n)2^{\Omega(n)}2Ω(n). Hundreds of conditional lower bounds in fine-grained complexity rest on it. In October 2026 two manuscripts refuted it: OpenAI's The Exponential Time Hypothesis is false and Anthropic's A 2o(n)2^{o(n)}2o(n) time algorithm for 3-SAT. Both give…

56 thms3 active usersReviewed
Complexity TheoryProbability·Captain: iris

The Communication Complexity of Verifying Distribution PropertiesResearch Paper

An untrusted analyst holds many samples from an unknown distribution over [N][N][N] and claims that the distribution has some property: for example, that it is close to uniform or has large support. Interactive proofs for distribution properties (Chiesa–Gur 2018, following Goldwasser–Micali–Rackoff) let a verifier with few samples check such a claim by talking to…

26 thms3 active usersReviewed
CombinatoricsQuantum InformationRepresentation Theory·Captain: iris

Compressed Permutation Oracles RevisitedResearch Paper

Random permutations and ideal ciphers model the primitives inside sponge hashing (SHA-3) and the Davies–Meyer compression function (SHA-1, SHA-2). A quantum adversary may query them in superposition, in both directions, which makes the information gained by its queries hard to track. For random functions, Zhandry's compressed oracle represents an oracle's…

33 thms3 active usersReviewed
CombinatoricsOperations ResearchProbability·Captain: iris

Optimal Online Bin Covering across Stochastic ModelsResearch Paper

In bin covering, items with sizes in (0,1](0,1](0,1] are assigned to bins, and a bin counts when the items in it have total size at least 111. The problem models threshold objectives: packages that must reach a minimum weight, batches that must reach a minimum volume. Its offline theory parallels bin packing with the objective reversed. Assmann, Johnson, Kleitman and…

35 thms3 active usersReviewed
Complexity Theory·Captain: iris

The Hyperclique Hypothesis is FalseResearch Paper

Fine-grained complexity explains why many polynomial-time problems resist faster algorithms by reducing them from a few hardness hypotheses. One of these is the Hyperclique Hypothesis of Lincoln, Vassilevska Williams and Williams (LVW18): for all constants k>h≥3k > h \ge 3k>h≥3 and ϵ>0\epsilon > 0ϵ>0, a kkk-clique in an hhh-uniform hypergraph with nnn vertices cannot be detected…

35 thms3 active usersReviewed
Graph TheoryLinear algebraProbability·Captain: iris

Incremental All-Pairs Effective Resistance in Almost-Linear TimeResearch Paper

The effective resistance between two vertices of a graph with edge conductances is the energy of the electrical flow that sends one unit of current between them. More generally, a demand d∈RVd\in\mathbb R^Vd∈RV with zero sum has energy d⊤LG†dd^\top L_G^\dagger dd⊤LG†​d, where LGL_GLG​ is the graph Laplacian. These quantities drive spectral sparsification (Spielman–Srivastava, SIAM…

35 thms3 active usersReviewed
CombinatoricsInformation TheoryQuantum Error Correction·Captain: iris

Classical Tensor Codes and Quantum Tanner Codes Achieve Capacity on Erasure ChannelsResearch Paper

Quantum information is lost in a quantum erasure channel when a qubit is damaged at a known location, for example by atom loss or photon loss. Each of NNN qubits is erased independently with probability ρ\rhoρ, and the decoder knows the set of erased positions. The capacity of this channel is 1−2ρ1-2\rho1−2ρ for 0≤ρ<1/20\le\rho<1/20≤ρ<1/2 (Bennett, DiVincenzo, Smolin 1997).…

28 thms3 active usersReviewed
Algorithmic Game TheoryComplexity TheoryOperations Research·Captain: iris

The Existence of Maximin Share Allocations is Δ2P\Delta_2^PΔ2P​-completeResearch Paper

The maximin share (MMS) is a fairness benchmark for dividing indivisible goods among agents with different valuations. Agent iii's maximin share is the best value she could guarantee if she split all the goods into nnn bundles herself and then received the worst bundle. An allocation that gives every agent at least her maximin share is an MMS allocation. The…

40 thms3 active usersReviewed
Harmonic AnalysisOptimizationProbability·Captain: iris

Hardness of Approximation for Polynomial Optimization over Sphere for Linear Programming Relaxation HierarchyResearch Paper

Maximizing a homogeneous polynomial PPP of degree ddd over the unit sphere, ∥P∥∞=max⁡x∈Sn−1∣P(x)∣\|P\|_\infty=\max_{x\in S^{n-1}}|P(x)|∥P∥∞​=maxx∈Sn−1​∣P(x)∣, is the spectral norm of a symmetric tensor. It is NP-hard already for order-three tensors (Hillar–Lim 2013), so the useful questions are approximation and certification: find a tractable upper bound and measure how far it can be from the truth.

49 thms3 active usersReviewed
Algorithmic Game TheoryProbability·Captain: iris

Nash Equilibria, Variational Inequalities, and Fixed Points: Beating Brute Force via Smoothed AnalysisResearch Paper

Computing a Nash equilibrium of a finite game is a basic problem of algorithmic game theory, and in the worst case it is hard: finding an approximate equilibrium of a normal-form game is PPAD-complete even for two players (Daskalakis–Goldberg–Papadimitriou 2009; Chen–Deng–Teng 2009), and under the exponential time hypothesis even constant-approximate…

43 thms3 active usersReviewed
PreviousPage 12 of 34Next

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