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
AlgebraAnalysisCombinatorics+3·Captain: LG

Formal Conjectures Portfolio: Bateman-Horn and CompanionsOpen Problem

Wikipedia's pages on open problems are, for many mathematicians, the first contact with a conjecture: a one-paragraph statement, a short history, a list of partial results. The Formal Conjectures library (Google DeepMind, Apache-2.0) turned a large part of that material into Lean 4 statements, so that the conjectures can be attacked — and, just as…

100 thms17 active usersReviewed
Optimization·Captain: mikedeng1

The Design of Approximation Algorithms 11: Planar weighted independent-set PTASTextbook

A graph records pairs of objects that cannot be chosen together. An independent set is a choice with no conflicting pair. When each vertex has a nonnegative weight, maximum weighted independent set asks for a conflict-free set with the greatest total weight. This model occurs when choices have values and pairwise incompatibilities. On general graphs the…

7,639 thms13 active usersReviewed
🏆Completed
Operations Research·Captain: Shuze Chen

The k-Server ConjectureOpen Problem

The kkk-server problem was introduced by Manasse, McGeoch, and Sleator (STOC 1988 / J. Algorithms 1990) as a common generalization of paging, weighted caching, and related sequential decision problems, and their kkk-server conjecture has since become the central open question of competitive analysis. The conjecture asserts that a single ratio — exactly kkk —…

144 thms13 active usersReviewed
🏆Completed
Captain: marwahaha

More Asymmetry Bound: omega < 2.37134Research Paper

The matrix-multiplication exponent measures how the arithmetic complexity of multiplying square matrices grows with the ir dimension. Known upper bounds come from constructing large independent matrix products inside tensor powers whose asymptotic rank is controlled. Improving the extraction, rather than finding a lower-rank starting tensor, has driven…

169 thms12 active usersReviewed
🏆Completed
Captain: marwahaha

Duan–Wu–Zhou Fourth-Power Bound: omega < 2.37193Research Paper

The matrix-multiplication exponent measures how the arithmetic cost of multiplying square matrices grows with their dimension. An improvement in this exponent is relevant both to algebraic complexity and to algorithms whose running times depend on matrix multiplication. This mission formalizes a known improvement using the fourth power of the…

146 thms12 active usersReviewed
🏆Completed
Complexity TheoryOptimization·Captain: Shuze Chen

Tetris is Hard, Even to Approximate: Inapproximability of cleared rowsResearch Paper

Knowing every future piece removes uncertainty from Tetris, but it does not remove the computational difficulty of choosing placements. Offline Tetris asks a player to plan against an entire finite piece sequence revealed in advance. The initial board can already contain occupied cells, and its dimensions are part of the input. Demaine, Hohenberger and…

62 thms11 active usersReviewed
🏆Completed
CombinatoricsOperations Research·Captain: mikedeng1

One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties 1: Minimizing the Total Discrepancy from Preferred Times Is NP-CompleteResearch Paper

Scheduling with earliness and tardiness penalties asks for schedules in which a job finishing early is as undesirable as a job finishing late. The model fits production planned for just-in-time delivery, where finished goods held before their due date cost money, and sequences of experiments tied to fixed external events. It departs from classical…

37 thms10 active usersReviewed
🏆Completed
Complexity TheorycryptographyQuantum Information·Captain: Shuze Chen

Information Loss Is All You Need: TC^0 Pseudorandomness from Worst-Case LatticesResearch Paper

Learning with errors (LWE) is the standard source of post-quantum hardness: given many noisy inner products As+e mod qA s + e \bmod qAs+emodq of a secret sss, distinguish them from uniform. Regev showed in 2005 that this is as hard, for quantum algorithms, as worst-case approximate lattice problems (Reg05). Removing the random error makes the samples deterministic: learning…

138 thms9 active usersReviewed
Algebraic GeometryComplexity Theory·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…

76 thms9 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research·Captain: mikedeng1

Edge Dominating Sets in Graphs: The Edge Dominating Set Problem Is NP-Complete for Bipartite Graphs of Maximum Degree 3Research Paper

A set FFF of edges of a graph dominates the graph if every other edge shares an endpoint with an edge of FFF. Every maximal matching is an edge dominating set, and conversely a minimum edge dominating set can be turned into a minimal maximal matching of the same size, so the edge dominating set problem is the problem of finding a minimum maximal matching.…

23 thms9 active usersReviewed
🏆Completed
Formal VerificationMathematical Logic·Captain: Rizwan G Mir

The Cook-Levin Theorem: NP-Completeness of Boolean Satisfiability in Lean 4Research Paper

The Cook-Levin theorem states that CNF SAT is NP-complete. This mission formalizes the theorem over a multi-tape Turing machine model in Lean 4.

175 thms9 active usersReviewed
🏆Completed
CombinatoricsComplexity Theory·Captain: LG

4-to-1 Games with Perfect CompletenessResearch Paper

Many approximation problems resist the standard PCP toolkit: the best known NP-hardness factors for Max-Cut, Vertex-Cover and approximate graph colouring are far from the best known polynomial-time algorithms. To explain this gap, Khot (CCC 2002) proposed the Unique-Games Conjecture and the family of ddd-to-1 Games Conjectures. The ddd-to-1 conjectures assert pe…

21 thms9 active usersReviewed
🏆Completed
Quantum Information·Captain: mikedeng1

Quantum circuit compilation with constant overheadResearch Paper

Quantum algorithms are usually written as circuits of arbitrary one- and two-qubit gates. A fault-tolerant machine executes only a finite instruction set, and a standard choice is G={H,T,CNOT}\mathcal G=\{H,T,\mathrm{CNOT}\}G={H,T,CNOT}. An arbitrary rotation cannot be written exactly over a finite gate set, so every compiler approximates. Ross and Selinger (RS16) approximate a…

31 thms8 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research·Captain: mikedeng1

On General Routing Problems: The Rural Postman Problem Is NP-Complete on Undirected and on Directed GraphsResearch Paper

Arc routing problems model street sweeping, snow ploughing, mail delivery and meter reading: a vehicle must traverse certain streets of a road network and return to its depot at least cost. Orloff (Networks 4, 1974) proposed the general routing problem (GRP), which asks for a minimum-weight closed tour in a graph that visits a set of required nodes and…

28 thms8 active usersReviewed
Algorithmic Game TheoryComplexity Theory·Captain: mikedeng1

Anyone but Him: The Complexity of Precluding an Alternative: Control by Partition of Voters Is Vulnerable or NP-Complete for Plurality, Condorcet and Approval Voting, Depending on Tie-HandlingResearch Paper

An election is run by someone — a chair, a committee, an organiser — who can shape it without touching a single ballot: by deciding which candidates appear, which voters are registered, or how the electorate is split into bodies that pre-select nominees. Bartholdi, Tovey and Trick (1992) proposed to measure how well a voting rule protects itself against…

50 thms8 active usersReviewed
CombinatoricsComplexity Theory·Captain: mikedeng1

Complexity of n-Queens Completion: n-Queens Completion Is NP-Complete and #P-CompleteResearch Paper

The n-Queens problem, placing nnn mutually non-attacking queens on an n×nn\times nn×n chessboard, is a standard benchmark in constraint programming and artificial intelligence. As a decision problem it is trivial: a solution exists for every nnn other than 222 and 333 and can be written down in closed form, and the input ⟨n⟩\langle n\rangle⟨n⟩ has only log⁡n\log nlogn bits. This has…

44 thms8 active usersReviewed
🏆Completed
Complexity TheoryOperations Research·Captain: mikedeng1

Complexity of Machine Scheduling Problems 5: KNAPSACK Reduces to Two-Machine Flow Shop Makespan with a Release Date or Tree Precedence and to Two- and Three-Machine Job Shop MakespanResearch Paper

In 1975 P. Brucker, J. K. Lenstra and A. H. G. Rinnooy Kan classified a large part of deterministic machine scheduling by computational complexity, using the then new theory of NP-completeness of Cook and Karp. Their report, Complexity of Machine Scheduling Problems (Mathematisch Centrum, Amsterdam, 1975; published in Annals of Discrete Mathematics 1,…

16 thms8 active usersReviewed
🏆Completed
CombinatoricsComplexity TheoryOperations Research·Captain: mikedeng1

Scheduling Subject to Resource Constraints: Classification and Complexity I: Unit-Time Chains on Two Identical Machines with One Unit Resource Are Strongly NP-hardResearch Paper

Machine scheduling asks how to assign jobs to machines over time so that a criterion such as the makespan Cmax⁡C_{\max}Cmax​, the time at which the last job completes, is as small as possible. In practice jobs also compete for scarce resources beyond the machines themselves: tools, operators, memory, power. Błażewicz, Lenstra and Rinnooy Kan (DAM 1983) extended the…

46 thms8 active usersReviewed
🏆Completed
Captain: marwahaha

Davie–Stothers Fourth-Power Bound: omega < 2.3737Research Paper

The matrix-multiplication exponent ω\omegaω measures the asymptotic arithmetic cost of multiplying square matrices. An upper bound ω<c\omega<cω<c means that, over the field under consideration, two n×nn\times nn×n matrices can be multiplied using O(nc+ε)O(n^{c+\varepsilon})O(nc+ε) field operations for every ε>0\varepsilon>0ε>0. It is a central benchmark in algebraic complexity and controls…

183 thms8 active usersReviewed
Computational ComplexityGraph TheoryQuantum Information·Captain: mikedeng1

The Complexity of Space–Reset Tradeoffs in Online Quantum ComputationResearch Paper

Quantum devices that process a stream of inputs — a quantum memory interleaved with arriving qubits, a sequential state generator, a device simulating a correlated noise process — keep a bounded private memory between time steps and remove information by irreversible operations such as qubit RESET. Both resources are limited on hardware: the number of…

42 thms7 active usersReviewed
Complexity TheoryQuantum Information·Captain: iris

Optimal and Verifiable Quantum Advantages in Communication ComplexityResearch Paper

Communication complexity measures how many bits (or qubits) two parties, Alice and Bob, must exchange to solve a joint task when each sees only part of the input. It is one of the few settings where quantum advantages can be proved unconditionally, and such separations now underpin experimental demonstrations of quantum advantage in space (Kretschmer et al.…

39 thms7 active usersReviewed
CombinatoricsProbability·Captain: iris

Concentration from Product Moments via an Additional Element of RandomnessResearch Paper

Many randomized algorithms and constructions produce a sum ∑iYi\sum_i Y_i∑i​Yi​ of [0,1][0,1][0,1]-valued quantities, each computed from a few random bits that are shared with other summands. The read-Δ\DeltaΔ inequality of Gavinsky, Lovett, Saks and Srinivasan (Random Structures & Algorithms 2015) states that if each bit influences at most Δ\DeltaΔ of the YiY_iYi​ and the bits are…

30 thms7 active usersReviewed
🏆Completed
Quantum Information·Captain: iris

When are bosonic Gaussian states classical to learn?Research Paper

Bosonic Gaussian states describe laser light, thermal radiation, squeezed light and the modes of many continuous-variable quantum devices. They sit on the boundary between quantum and classical physics: a Gaussian state is fixed by a mean vector and a covariance matrix, exactly like a classical Gaussian random vector, yet some Gaussian states are entangled…

111 thms7 active usersReviewed
🏆Completed
CombinatoricsComplexity TheoryInformation Theory·Captain: mikedeng1

Finding Short Synchronizing Words for Prefix Codes: Unless P = NP, the Shortest Synchronizing Word of a Binary Huffman Decoder Cannot Be Approximated Within c log nResearch Paper

A prefix code is a set of binary words none of which is a prefix of another; Huffman codes are the standard example. Such a code is decoded by an automaton that walks down the code tree and returns to the root after each codeword. A transmission error can make the decoder lose track of codeword boundaries. A synchronizing word brings the decoder to one…

41 thms7 active usersReviewed
Complexity Theory·Captain: avi

Integer multiplication: κ = 0.00012612978530233 (Jain round eight)Open Problem

Multiplying two binary integers is a basic task in computational complexity. The relevant resource here is the number of individual steps made by a machine whose tapes can only be accessed through moving heads. Harvey and van der Hoeven established an O(nlog⁡n)O(n\log n)O(nlogn) bound in this model. The OpenAI manuscript proposes a positive saving in the exponent of the…

163 thms7 active usersReviewed
PreviousPage 1 of 58Next

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