Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Complexity Theory

570 missions · 156 completed

Missions

Open414Completed156All570
Theoretical Computer Science·Captain: wurtle

Integer multiplication: κ = 0.000051016920170078 (community PR #62)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…

99 thms6 active usersReviewed
🏆Completed
Captain: avi

Integer Multiplication in O(n (log n)^(1-κ)) TimeResearch Paper

Schönhage and Strassen conjectured in 1971 that nlog⁡nn\log nnlogn is the optimal order of growth for multiplying two nnn-bit integers on a multitape Turing machine. Harvey and van der Hoeven proved the matching upper bound O(nlog⁡n)O(n\log n)O(nlogn) (Annals of Mathematics, 2021). In September 2026, a preprint by OpenAI, Integer multiplication below nlog⁡nn\log nnlogn, claimed that this bound can…

74 thms6 active usersReviewed
🏆Completed
Operations ResearchOptimizationTheoretical Computer Science·Captain: mikedeng1

Scheduling Problems with Two Competing Agents 6: PARTITION Reduces to Two Agents Each Bounding Their Own Total Completion Time on One MachineResearch Paper

In many production and service settings a single resource is shared by parties with different goals: two departments sending orders to the same machine, two customers of a contract manufacturer, or two classes of requests on one processor. Multi-agent scheduling models this directly. Each agent owns its own jobs and its own objective, and a schedule is…

16 thms6 active usersReviewed
🏆Completed
Operations ResearchOptimizationTheoretical Computer Science·Captain: mikedeng1

Scheduling Problems with Two Competing Agents 2: KNAPSACK Reduces to Minimizing One Agent's Total Weighted Completion Time Under a Makespan Bound for the OtherResearch Paper

In many production and logistics settings a single resource is shared by parties with different goals: two departments of a plant that send orders to the same machine, two customers of a contract manufacturer, or two classes of traffic on one processor. Multi-agent scheduling models this directly. Each agent owns its own jobs and its own objective, and a…

14 thms6 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Complexity of Machine Scheduling Problems 4: KNAPSACK Reduces to Single-Machine Total Completion Time with One Release DateResearch Paper

Minimizing the total completion time ∑jCj\sum_j C_j∑j​Cj​ of jobs on a single machine is one of the oldest problems in scheduling theory. When every job is available at time 000, processing the jobs in order of nondecreasing processing time is optimal (the shortest-processing-time rule), so the problem is solved by sorting. Release dates, times before which a job may…

18 thms6 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Complexity of Machine Scheduling Problems 7: Makespan Reduces to Total Completion Time on Identical Machines with Precedence ConstraintsResearch Paper

Scheduling jobs on parallel machines under precedence constraints is the core model of project and parallel-processing scheduling: a job may start only after its predecessors have finished. Two criteria dominate the literature, the makespan Cmax⁡C_{\max}Cmax​ (when does the last job finish?) and the total completion time ∑jCj\sum_j C_j∑j​Cj​ (how long do jobs wait on…

20 thms6 active usersReviewed
🏆Completed
Graph TheoryOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Complexity of Machine Scheduling Problems 6: DIRECTED HAMILTON PATH Reduces to No-Wait Flow Shop Makespan and Total Completion TimeResearch Paper

In a no-wait flow shop every job passes through the machines M1,…,MmM_1,\dots,M_mM1​,…,Mm​ in the same order, and once it has started it may never wait between two machines. The constraint comes from processes in which the material changes state if it is left standing, such as hot metal rolling, chemical and food processing, and some pharmaceutical lines; see the survey of…

25 thms6 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Complexity of Machine Scheduling Problems 3: KNAPSACK Reduces to Single-Machine Total Weighted TardinessResearch Paper

Minimizing total weighted tardiness on a single machine, written n∣1∣∣∑wjTjn|1||\sum w_jT_jn∣1∣∣∑wj​Tj​, is one of the basic problems of deterministic scheduling. A job that finishes after its due date is penalized in proportion to its lateness and its weight. Practitioners use this criterion to model penalty clauses and customer priority. In the theory it was a reference…

23 thms6 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Complexity of Machine Scheduling Problems 2: KNAPSACK Reduces to Single-Machine Maximum Lateness, Weighted Number of Late Jobs, and Weighted Completion Time with DeadlinesResearch Paper

Deterministic machine scheduling was one of the first application areas of the theory of NP-completeness. After Cook (1971) and Karp (1972) showed that a large family of combinatorial problems are polynomially equivalent, Brucker, Lenstra and Rinnooy Kan set out to locate the boundary between the polynomially solvable and the NP-complete scheduling…

15 thms6 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Complexity of Machine Scheduling Problems 1: PARTITION Reduces to Makespan and to Weighted Completion Time on Two Identical MachinesResearch Paper

Deterministic machine scheduling asks how to process a set of jobs on a set of machines so that an overall criterion, such as the time at which the last job finishes, is as small as possible. In the early 1970s many such problems had efficient algorithms (Johnson's rule for the two-machine flow shop, Smith's ratio rule for a single machine, Lawler's rule…

15 thms6 active usersReviewed
Quantum InformationTheoretical Computer Science·Captain: mikedeng1

Tight Post-Quantum Parallel Repetition for Private-Coin ArgumentsResearch Paper

Parallel repetition is the basic way to reduce the soundness error of a proof system without adding rounds: run kkk independent copies and accept if enough of them accept. The analysis is subtle, because the verifier's copies are independent but a cheating prover may correlate its answers across all of them. For computationally sound protocols the reduction…

27 thms5 active usersReviewed
CombinatoricsComputational ComplexityTheoretical Computer Science·Captain: Shuze Chen

Near-Cubic Gate and Near-Quartic Wire Lower Bounds for SYM ◦THR CircuitsResearch Paper

Depth-two threshold circuits are the first case of the open problem of proving strong lower bounds against constant-depth threshold circuits, which model neural networks with linear threshold units. Superpolynomial lower bounds are open even at depth two. Williams' algorithmic method (Wil13, Wil14) turns a fast algorithm that analyzes a circuit class into a…

26 thms5 active usersReviewed
🏆Completed
CombinatoricsComputational Complexity·Captain: iris

The CNF Encoding Complexity of Boolean FunctionsResearch Paper

A CNF encoding of a boolean function f:{0,1}n→{0,1}f:\{0,1\}^n\to\{0,1\}f:{0,1}n→{0,1} is a CNF formula over the input variables and extra auxiliary variables such that f(x)=1f(x)=1f(x)=1 exactly when some setting of the auxiliaries satisfies the formula. Encodings of this kind are how problems are handed to SAT solvers, and the choice of encoding is often decisive for whether a problem can be…

84 thms5 active usersReviewed
Combinatorics·Captain: mikedeng1

The 3-Uniform Hyperclique Hypothesis is FalseResearch Paper

A 3-uniform hypergraph records relations involving three vertices at a time. Its vertices may be any labels in a finite set, and each hyperedge consists of three distinct vertices. A four-hyperclique consists of four vertices for which every three-vertex subset is a hyperedge. Detecting this pattern has been used as a benchmark for fine-grained complexity:…

14 thms5 active usersReviewed
Computational GeometryMachine LearningOperations Research·Captain: Shuze Chen

Exact Euclidean k-Means: Faster in the Plane, Hard Beyond ItResearch Paper

Exact Euclidean k-means asks for the least possible sum of squared distances from data points to freely located centers. Two parameters shape the problem: the number of centers, k, and the ambient dimension, d. An algorithm whose exponent depends on their product can be polynomial for every fixed pair and still become impractical as either parameter grows.…

26 thms5 active usersReviewed
Algebraic GeometryTheoretical Computer Science·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 thms5 active usersReviewed
Convex OptimizationProbability·Captain: mikedeng1

A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle ModelResearch Paper

A membership oracle answers whether a specified point belongs to an unknown set. It supplies one Boolean answer per query, even when the point has arbitrary real coordinates. In convex optimization this is a basic way to describe a feasible region without giving its inequalities. The question is how many such answers an algorithm needs before it can…

24 thms5 active usersReviewed
Information TheoryTheoretical Computer Science·Captain: mikedeng1

The Exact Communication Threshold for Parallel RepetitionResearch Paper

A two-player game gives Alice and Bob related questions and asks them to produce a valid pair of answers. Each player initially sees only their own question. Such games model the separated verifiers and answer constraints used in complexity theory. Repeating a game independently is useful when simultaneous success becomes unlikely. The question addressed…

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

A Dichotomy for Exact Quantum Circuit AmplitudesResearch Paper

Which quantum circuits can a classical computer simulate exactly? The Gottesman–Knill theorem shows that Clifford circuits can be simulated by tracking stabilizer generators (Aaronson–Gottesman 2004); Valiant's matchgates give a second mechanism, and bounded Schmidt rank a third. In 2005 Aaronson asked whether these simulation algorithms have a common…

43 thms5 active usersReviewed
Graph TheoryMathematical Logic·Captain: iris

A Uniform Algorithm for Strict NP on Bounded-Treedepth StructuresResearch Paper

Strict NP (SNP) is the class of properties of finite structures expressible as ∃R1…Rr ∀x1…xk ψ\exists R_1\dots R_r\,\forall x_1\dots x_k\,\psi∃R1​…Rr​∀x1​…xk​ψ with ψ\psiψ quantifier-free. It contains many graph-layout and colouring problems: deciding whether the stack number, queue number or track number of a graph is at most kkk, whether its twin-width is at most kkk, or whether it is ccc-colour…

31 thms5 active usersReviewed
CombinatoricsGraph 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
Theoretical 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
Theoretical 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
Theoretical 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
AlgebraCombinatoricsTheoretical Computer Science·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
PreviousPage 2 of 23Next

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