CLRS — Chapter 4, §4.2: Strassen Matrix Multiplication — Correctness and Running TimeTextbook
Prove2Me mission category: Textbook.
A coordinated effort to formalize the mathematics of theoretical computer science in Lean 4.
Scope: missions in computational complexity, algorithms and optimization, data structures, automata and computability, randomized and approximation algorithms, cryptography, learning theory, information theory, algorithmic game theory, combinatorics, computational geometry, and distributed computing.
491 completed missions
Prove2Me mission category: Textbook.
Prove2Me mission category: Textbook.
Prove2Me mission category: Textbook.
Prove2Me mission category: Textbook.
Sampling an entire finite-state execution is a different computational task from recognizing a supplied word. A membership circuit must answer correctly on its given input. A sampler instead chooses the input together with its associated output, while preserving their joint distribution. This distinction is relevant when finite-state models describe…
A set of unit-length jobs with precedence constraints is to be run on a fixed number of identical machines so that all jobs finish as early as possible. For two machines this was solved in 1969–1972; for a number of machines given as part of the input the problem is NP-complete (Ullman, 1975). Whether the problem is polynomial-time solvable for three machine…
Multiplying matrices is a basic operation whose asymptotic cost is measured by the number of scalar arithmetic operations needed as the matrix dimensions increase. The familiar entry-by-entry algorithm has cubic cost. The question addressed here is how small an exponent can describe exact multiplication of square matrices when algorithms may use more…
Status: complete. This mission records a finished formalization rather than an open call for work. Every statement below, including the goal, was uploaded together with a proof that the platform has verified, so there is nothing left to prove.
All-pairs shortest paths (APSP) computes the shortest distance between every pair of vertices in a weighted graph.
Set cover is the standard worked example of the primal-dual method, and Chapter 2 of Buchbinder's thesis uses it that way: it is where the machinery of §2.1 is first turned on a concrete NP-hard problem. Two analyses appear. The greedy algorithm, analysed by dual fitting, buys the set with the best cost-per-newly-covered-element ratio and charges the price…
An online algorithm must commit to decisions before it knows the rest of its input, and it is judged by competitive analysis: the ratio between its cost and the cost of an optimal solution computed with full knowledge of the input. A recurring obstacle in this area is that each problem seems to need its own ad hoc potential-function argument. Buchbinder's…
Computability theory studies which questions admit algorithms and how the unsolvable questions compare with one another. A decision problem can be represented by a set of natural numbers: the question on input is whether belongs to the set. Even when there is no algorithm that always answers this question, there may be an algorithm that eventually…
Classical Eilenberg correspondence theorems connect algebraic descriptions of finite-state behavior with language-theoretic closure principles. The version developed by Juan Climent Vidal and Enric Cosme Llópez replaces one-sorted monoids by many-sorted algebras, so that operations may accept arguments of several prescribed sorts and return a value of…
Kleene's theorem (Kleene 1956; McNaughton–Yamada 1960) is a cornerstone of formal language theory: over a free monoid, the languages recognized by finite automata are exactly the regular ones — those built from finite languages by union, concatenation, and the Kleene star. Mezei and Wright (1967) lifted recognizability off strings, calling a subset of an…
Erdős Problem 788 asks how large a set can always be retained when prescribed distinct pair-sums are forbidden. This mission formalizes the repository’s strengthened version of Theorem 1.1: an explicit lower bound valid for every , an eventual quantitative upper bound, the conclusion , and the exact affirmative answer to the original…
Prove Schönhage's 1981 bound that the matrix-multiplication exponent satisfies omega < 51/20, via the tau theorem and the asymptotic sum inequality.
| Rank | Contributor | Accepted solutions | Submitted problems |
|---|---|---|---|
| 1 | Eyal1990 | 5073 | 7706 |
| 2 | fizzyinc3 | 1304 | 7 |
| 3 | marwahaha | 643 | 870 |
| 4 | mrfancypants | 629 | 0 |
| 5 | dbenbenn | 546 | 543 |
| 6 | kmehltretter82 | 385 | 111 |
| 7 | Nihal | 296 | 0 |
| 8 | Nickrobbins95 | 269 | 8 |
| 9 | Shuze Chen | 224 | 794 |
| 10 | shivm | 208 | 0 |