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
cryptographyTheoretical Computer Science·Captain: iris

Add/XNOR Chains: An NP-Complete Boolean–Arithmetic Problem at the Meet-in-the-Middle BarrierResearch Paper

Addition modulo 2m2^m2m and bitwise XOR are the two cheapest operations on machine words, and mixing them is the standard way of destroying algebraic structure: it underlies ARX (add–rotate–XOR) ciphers and most hash functions in use. The paper of Wang, Lv, Shen and Zhang isolates the decision version of this mixing in its simplest form. A chain of words is…

27 thms4 active usersReviewed
Algorithmic Game TheoryEconomicsOperations Research·Captain: iris

Exploring the Tractability Frontier of Hylland–Zeckhauser ModelsResearch Paper

The Hylland–Zeckhauser (HZ) mechanism allocates indivisible goods without money, for instance dormitory rooms to students: each of NNN buyers receives one unit of artificial money and buys probability shares of NNN goods, each available in one copy, and equilibrium prices clear the market. The resulting doubly stochastic allocation is a lottery over assignments…

47 thms4 active usersReviewed
Quantum InformationTheoretical Computer Science·Captain: iris

Near-Optimal Gap Amplification for Nonnegative Unentangled Quantum ProofsResearch Paper

In QMA(k)\mathsf{QMA}(k)QMA(k) a polynomial-time quantum verifier receives kkk quantum proofs that are promised to be unentangled with one another. Whether this promise adds power, and how far the completeness–soundness gap of such systems can be amplified, are central open questions in quantum complexity theory (Harrow–Montanaro 2013; Jeronimo–Wu 2023). The usual tool…

51 thms4 active usersReviewed
Algorithmic Game TheoryTheoretical Computer Science·Captain: iris

FIXP-Completeness via Reciprocal Gates: Applications to Second-Price AuctionsResearch Paper

Fixed-point theorems guarantee that equilibria exist without saying how to find them. Two-player Nash equilibria have rational solutions of polynomial encoding length, and computing them is PPAD-complete (Chen, Deng, Teng 2009). Games with three or more players may have only irrational equilibria, so exact computation does not fit a discrete class. FIXP,…

33 thms4 active usersReviewed
cryptographyQuantum Information·Captain: iris

From Computational Nonlocality to Public-Key Encryption and CommitmentsResearch Paper

Public-key encryption is usually built from structured hardness assumptions such as factoring or learning with errors. In the quantum world one may ask for weaker foundations: protocols in which the honest parties are quantum computers that exchange only classical messages (QCCC, quantum computation with classical communication), and whose security rests on…

81 thms4 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: iris

Revisiting the XOR lemmaResearch Paper

Yao's XOR lemma is a basic hardness-amplification result in complexity theory: if a Boolean function fff has correlation at most ϵ\epsilonϵ with every circuit of size sss, then the XOR of kkk independent copies of fff has correlation about ϵk\epsilon^kϵk with circuits of size close to sss (Goldreich–Nisan–Wigderson 1995). It is used throughout pseudorandomness,…

23 thms4 active usersReviewed
Convex OptimizationGraph TheoryLinear algebra+1·Captain: iris

Asymptotic Rank of Weighted Graph Tensors via Completely Positive CoversResearch Paper

The asymptotic rank of a tensor measures how cheaply many copies of it can be computed together. For the triangle graph tensor it is the matrix multiplication exponent: log⁡2R~F(GT2(K3))=ωF\log_2\tilde R_{\mathbb F}(\mathsf{GT}_2(K_3))=\omega_{\mathbb F}log2​R~F​(GT2​(K3​))=ωF​ over every field F\mathbb FF (Bürgisser–Clausen–Shokrollahi 1997, Prop. 15.1). Graph tensors extend this object from three…

39 thms4 active usersReviewed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: iris

Counting over Unbreakable Decompositions: A Single-Exponential Parameterized Algorithm for Minimum BisectionResearch Paper

In Minimum Bisection, the input is a graph GGG on nnn vertices and an integer kkk, and the question is whether V(G)V(G)V(G) can be split into sets of sizes ⌊n/2⌋\lfloor n/2\rfloor⌊n/2⌋ and ⌈n/2⌉\lceil n/2\rceil⌈n/2⌉ with at most kkk edges between them. The problem is NP-hard, and it has been a central test case for parameterized cut problems because its constraint is global: whether part of a…

38 thms4 active usersReviewed
Algorithmic Game TheoryOperations Research·Captain: iris

On Existence and Computational Complexity of Quasi-strict EquilibriaResearch Paper

A Nash equilibrium of a two-player game may leave some best responses unplayed: a player is indifferent between several pure strategies and puts weight on only some of them. Harsanyi (1973) introduced quasi-strict equilibria, the refinement in which every pure best response is played with positive probability, and proved that in almost all finite games…

80 thms4 active usersReviewed
ProbabilityTheoretical Computer Science·Captain: iris

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUTResearch Paper

MAX-3-CUT asks for the partition of the vertices of a finite undirected graph into three sets that maximizes the number of edges joining different sets. It is the three-colour version of MAX-CUT and is equivalent to the Maximum 3-Colorable Subgraph problem. A random assignment of vertices cuts 2/32/32/3 of the edges in expectation. Frieze and Jerrum (1997) general…

70 thms4 active usersReviewed
AlgebraCombinatoricsTheoretical Computer Science·Captain: iris

On Robust Promise CSPs: A Boolean Dichotomy, Sharp Quantitative Bounds, and Soft-Equality TransferResearch Paper

A promise constraint satisfaction problem (PCSP) asks, given an instance that is satisfiable with respect to a strong family of relations, for an assignment satisfying a weaker family. Its robust version asks for more: when some assignment violates only an ϵ\epsilonϵ fraction of the strong constraints, an algorithm must return an assignment that violates at…

57 thms4 active usersReviewed
ProbabilityQuantum InformationTheoretical Computer Science·Captain: iris

Verifiable quantum advantage based on polynomials with planted structuresResearch Paper

Random-circuit sampling experiments claim quantum advantage by producing samples that a classical computer cannot produce in reasonable time. The usual test, the linear cross-entropy benchmark (XEB), scores samples by their ideal output probabilities, and computing those probabilities is as hard as simulating the circuit. Every such experiment therefore…

46 thms4 active usersReviewed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: iris

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor (and More)Research Paper

Graphs excluding a fixed planar graph as a minor have bounded treewidth (Robertson–Seymour 1986), so every problem expressible in monadic second-order logic, Max Independent Set included, is polynomial on them. The analogous statement for induced minors, obtained by deleting vertices and contracting edges but never deleting edges, fails for problems such as…

40 thms4 active usersReviewed
Markov ChainOperations ResearchReinforcement Learning+1·Captain: iris

Quasipolynomial-Time Planning for Decodable POMDPsResearch Paper

Partially observable Markov decision processes (POMDPs) model sequential decisions under hidden state: robot navigation with noisy sensors, inventory control with unobserved demand, medical treatment with imperfect tests. Exact planning in a finite-horizon POMDP is PSPACE-hard even with time-homogeneous dynamics and deterministic observations (Papadimitriou–…

41 thms4 active usersReviewed
CombinatoricsConvex OptimizationOperations Research+1·Captain: iris

A Faster Strongly Polynomial Time Algorithm for Submodular Function MinimizationResearch Paper

Submodular function minimization (SFM) asks for a set X⊆UX\subseteq UX⊆U minimizing a function h:2U→Rh:2^U\to\mathbb Rh:2U→R that satisfies h(X)+h(Y)≥h(X∩Y)+h(X∪Y)h(X)+h(Y)\ge h(X\cap Y)+h(X\cup Y)h(X)+h(Y)≥h(X∩Y)+h(X∪Y), given only a value oracle that returns h(X)h(X)h(X) on request. Graph and hypergraph cuts, coverage and entropy functions are submodular, and SFM is a subroutine of many algorithms in combinatorial…

26 thms4 active usersReviewed
Theoretical Computer Science·Captain: Secousses

Integer multiplication: κ = 0.003287014 (community PR #6453, conditional construction)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…

5 thms4 active usersReviewed
Algorithmic Game TheoryOperations Research·Captain: iris

Pure Nash Equilibria: Hard and Easy Games: Deciding Whether a Game Has a Pure Nash Equilibrium Is NP-Complete, Even for Graphical Games with 3-Bounded Neighborhood and Three ActionsResearch Paper

A pure Nash equilibrium is a choice of one action per player from which no player can gain by changing only her own action. Unlike mixed equilibria, which exist in every finite game by Nash's theorem, pure equilibria may fail to exist, so deciding whether one exists is a basic algorithmic question about any game model. It matters most for games with many…

30 thms4 active usersReviewed
Operations ResearchOptimization·Captain: iris

Serial batching to minimize the weighted number of tardy jobs: W[1]-hardness for #d + #p and for #p + #r, with XP algorithms for #d + #p + #w and for #p + #r + #wResearch Paper

In manufacturing, items move between facilities in boxes, pallets or carts, and everything placed in one container leaves together. Serial batch scheduling models this: a single machine processes jobs in batches, each batch costs a fixed setup time plus the processing times of its jobs, and all jobs of a batch complete together. Minimizing the weighted…

30 thms4 active usersReviewed
Operations ResearchOptimization·Captain: iris

The Complexity of Recognizing Facets for the Knapsack Polytope: Deciding Whether an Integer Inequality Defines a Facet of a Knapsack Polytope Is Dᵖ-CompleteResearch Paper

Integer programs are solved in practice by adding valid inequalities to a linear relaxation, and the strongest valid inequalities are the facet-defining ones. Knapsack polytopes are a central case: every row of a binary integer program defines one, and cuts derived from individual knapsack rows (lifted cover inequalities and their relatives) are part of…

30 thms4 active usersReviewed
Combinatorics·Captain: Shuze Chen

Hard Tiling Problems with Simple Tiles: Decision and counting completeness for right trominoes and square tetrominoesResearch Paper

A tiling problem asks whether copies of a few shapes can cover a specified region without overlap or gaps. Even when the shapes are small and fixed in advance, the region can encode a substantial combinatorial constraint. This makes tiling a useful setting for distinguishing local geometric simplicity from computational tractability. It also separates two…

11 thms4 active usersReviewed
Computational Geometry·Captain: Shuze Chen

Terrain Guarding is NP-Hard: NP-hardness of discrete and continuous terrain guardingResearch Paper

Selecting a small collection of sites with line of sight to an entire landscape is a geometric coverage problem. In the one-dimensional terrain model, the landscape is represented by a polygonal profile in the plane. The optimization question asks how many guards are needed to see every point of that profile. Applications motivating the model include road…

10 thms4 active usersReviewed
Dynamical SystemsLinear OptimizationOptimization·Captain: iris

Robust-to-Dynamics Optimization: With ρ(G) < 1, P Bounded and 0 ∈ int P, S = S_r for a Polynomial-Time-Computable r, and R-LD-LPs with ρ(G) ≤ ρ* < 1 Are Solvable in Polynomial TimeResearch Paper

A linear program assumes that a decision, once taken, stays where it was put. In many applications the decision is an initial state that then evolves under known dynamics: a portfolio drifting under a linear model of returns, an inventory or production profile propagated by a transition matrix, the state of a controlled system after its input is fixed.…

40 thms4 active usersReviewed
Computational Geometry·Captain: Shuze Chen

Orthogonal Terrain Guarding is NP-complete: NP-completeness of orthogonal terrain guardingResearch Paper

Terrain guarding asks how many observation sites are needed to see an entire landscape represented by a polygonal chain. The input specifies both the terrain and the number of guards available. A solution chooses observation sites whose combined visibility covers the whole landscape. Restricting the chain to horizontal and vertical edges simplifies its…

6 thms4 active usersReviewed
CombinatoricsComputational Complexity·Captain: mikedeng1

Kurodoko is NP-Complete: Deciding the Solvability of Kurodoko Puzzles Is NP-CompleteResearch Paper

Kurodoko ("where are the black squares?") is a pen-and-paper logic puzzle published by Nikoli. Its rules are short: colour some squares of a grid black so that the numbered squares stay white, no two black squares touch, the white squares stay connected, and every number counts the white squares it can see along its row and column. The computational…

15 thms4 active usersReviewed
🏆Completed
Discrete GeometryOperations ResearchOptimization·Captain: mikedeng1

Mixed-integer Quadratic Programming is in NP: Every Feasible Mixed-Integer Quadratic System Has a Feasible Solution of Polynomial Bit-SizeResearch Paper

Mixed-integer quadratic programming (MIQP) asks to minimize a quadratic function over the points of a polyhedron whose first ppp coordinates are integers. It contains integer linear programming, quadratic programming and combinatorial problems such as max-cut.

9 thms4 active usersReviewed
PreviousPage 5 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