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
Graph TheoryOptimization·Captain: mikedeng1

A Simple Subquadratic Cut Query Protocol for Directed ReachabilityResearch Paper

A directed reachability question asks whether a sequence of directed edges leads from a specified source vertex to a specified target. Ordinary graph search answers it when outgoing neighbours can be inspected. A different question arises when the graph is hidden and an oracle reports only how many edges leave a chosen vertex set. This outgoing-cut oracle re…

29 thms4 active usersReviewed
OptimizationTheoretical Computer Science·Captain: Shuze Chen

Optimal Approximation Algorithms For Satisfiable Ordering CSPsResearch Paper

An ordering problem asks for a single ranking that satisfies many local requirements. A requirement might say that one variable precedes another, or that one lies between two others. Even when a perfect ranking is promised to exist, an efficient algorithm may have difficulty finding it. Approximation asks what fraction of the requirements can always be…

29 thms4 active usersReviewed
Graph TheoryOptimizationProbability·Captain: Shuze Chen

An O(n0.1537)O(n^{0.1537})O(n0.1537)-Coloring Algorithm for 333-Colorable GraphsResearch Paper

A graph is 3-colorable if its vertices can be labelled with three colors so that adjacent vertices get different labels. Deciding 3-colorability is NP-complete, and finding a 3-coloring of a graph known to be 3-colorable is no easier. The natural algorithmic question is therefore approximate: given a 3-colorable graph on nnn vertices, how few colors suffice…

28 thms4 active usersReviewed
cryptographyTheoretical Computer Science·Captain: Shuze Chen

PPAD Hardness from SISResearch Paper

PPAD is the class of total search problems whose solutions are guaranteed by a parity argument on a directed graph of in- and out-degree at most one: if a source exists, another endpoint must exist. Computing a Nash equilibrium of a finite game is complete for it (Daskalakis–Goldberg–Papadimitriou 2009; Chen–Deng–Teng 2009). Since every instance has a…

24 thms4 active usersReviewed
cryptographyProbabilityTheoretical Computer Science·Captain: iris

Fast Provable Algorithms for Approximate CVP and Exact SVP on Random qqq-ary LatticesResearch Paper

Lattice-based cryptography rests on two problems over a uniformly random matrix H∈(Z/qZ)m×nH\in(\mathbb Z/q\mathbb Z)^{m\times n}H∈(Z/qZ)m×n: SIS, find a short nonzero xxx with Hx≡0(modq)Hx\equiv0\pmod qHx≡0(modq), and ISIS, find a short xxx with Hx≡t(modq)Hx\equiv t\pmod qHx≡t(modq). Both are questions about the q-ary lattice of HHH. The best provable algorithms for the closest vector problem on general lattices take time …

29 thms4 active usersReviewed
CombinatoricsLinear algebraTheoretical Computer Science·Captain: Shuze Chen

Counting Exact-One Hitting Sets in Subexponential TimeResearch Paper

Exact-One Hitting Set asks for a set of elements that meets every member of a given family exactly once. It is one of Karp's 21 NP-complete problems (Karp 1972, Problem 15), and in the language of satisfiability it is monotone exact satisfiability (XSAT): every set imposes the constraint "exactly one of these variables is true". Positive one-in-three…

17 thms4 active usersReviewed
cryptographyQuantum Information·Captain: iris

No linear stretching of single-copy quantum pseudorandomnessResearch Paper

A pseudorandom state generator (PRS) maps a classical key k∈{0,1}nk\in\{0,1\}^nk∈{0,1}n to an efficiently prepared quantum state ∣ϕk⟩|\phi_k\rangle∣ϕk​⟩ that no efficient algorithm can tell apart from a Haar-random state, given polynomially many copies (JLS18). PRS belong to Microcrypt: primitives that suffice for quantum cryptographic protocols but are potentially weaker than…

31 thms4 active usersReviewed
Probability·Captain: Shuze Chen

Optimal Black-Box Hardness Amplification for Integer SumsResearch Paper

A function can be difficult to predict on a small fraction of inputs while still allowing a predictor to be correct most of the time. Hardness amplification asks for a transformation that turns this limited unpredictability into a task on which small circuits rarely succeed. Integer summation is a particularly direct transformation: draw several independent…

13 thms4 active usersReviewed
cryptographyQuantum Information·Captain: iris

How to Build Pseudorandom Unitaries in MicrocryptResearch Paper

A pseudorandom unitary (PRU) is an efficiently implementable family of unitaries {Uk}\{U_k\}{Uk​} that no efficient quantum algorithm can tell apart from a Haar-random unitary, even with adaptive oracle access. A strong PRU withstands access to UUU, U†U^\daggerU†, UTU^TUT and U‾\overline UU, all coherently controlled. PRUs belong to Microcrypt, the quantum primitives that may…

28 thms4 active usersReviewed
Algorithmic Game Theory·Captain: iris

Sources of Complexity in Multi-Agent Combinatorial ContractsResearch Paper

In multi-agent contract design, a principal delegates a project to a team of agents whose actions she cannot observe, and pays each agent a share of the reward on success. The multi-agent combinatorial-action model of Dütting, Ezra, Feldman and Kesselheim (Multi-Agent Combinatorial Contracts, SODA 2025, pp.1857–1891), building on their Multi-Agent Contracts…

39 thms4 active usersReviewed
CombinatoricsMarkov ChainProbability·Captain: Shuze Chen

Single-Variable Connectivity in Random kkk-SATResearch Paper

Random kkk-SAT is the standard testbed for the geometry of solution spaces of random constraint satisfaction problems. Statistical-physics predictions describe a sequence of transitions as the clause density α=m/n\alpha = m/nα=m/n grows: below a clustering (reconstruction) threshold almost all solutions are expected to form one well-connected piece, above it the…

32 thms4 active usersReviewed
CombinatoricsComputational Geometry·Captain: Shuze Chen

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares: 2×2 square packing is NP-hard for orthogonally convex grid polygonsResearch Paper

Packing problems ask how many copies of a shape fit, without overlap, into a container. One of the simplest is to decide whether kkk axis-aligned unit squares can be placed in a given polygon; scaling by two gives the equivalent problem 2 × 2-Square-Packing: given a polygon PPP and an integer kkk, decide whether PPP has room for kkk axis-aligned 2×22 \times 22×2 squares.…

23 thms4 active usersReviewed
🏆Completed
Combinatorics·Captain: mikedeng1

On the Complexity of Symmetric Boolean Functions in Multiparty Private Simultaneous MessagesResearch Paper

Secure distributed computation asks parties to disclose enough information to evaluate a function while limiting what the evaluator can learn about their individual inputs. In the private simultaneous messages model, the parties share randomness hidden from the evaluator, each sends one message, and the evaluator recovers the answer. Even when each party…

30 thms4 active usersReviewed
Graph TheoryProbability·Captain: iris

Tight Non-Adaptive Query-Approximation Tradeoffs for Maximum Matching Size EstimationResearch Paper

Maximum matching is a benchmark problem for algorithms with limited access to their input. In the adjacency-list query model an algorithm cannot read the graph; it may only ask for the degree of a vertex or for the iii-th entry of its adjacency list. Outputting the edges of a constant-factor approximate matching in this model needs Ω(n2)\Omega(n^2)Ω(n2) queries…

64 thms4 active usersReviewed
AlgebraTheoretical Computer Science·Captain: iris

On derandomizing the line-point low-degree testResearch Paper

A low-degree test checks, by reading a function f:Fm→Ff : \mathbb F^m \to \mathbb Ff:Fm→F on a few points, whether fff is close to a polynomial of total degree at most kkk. The line-point test of Rubinfeld and Sudan picks a random line ℓ\ellℓ, reads fff on all of ℓ\ellℓ, and accepts if f∣ℓf|_\ellf∣ℓ​ is a univariate polynomial of degree at most kkk. Low-degree tests are the algebraic…

28 thms4 active usersReviewed
Graph Theory·Captain: iris

A Dichotomy for Terminal CyclabilityResearch Paper

Hamiltonian Cycle asks whether a graph has a cycle through all of its vertices. It is on Karp's list of NP-complete problems (Karp 1972) and stays NP-complete on planar graphs (Garey–Johnson–Tarjan 1976). Within minor-closed graph classes this gives a clean dichotomy: the problem is NP-complete on every minor-closed class containing all planar graphs, while…

46 thms4 active usersReviewed
CombinatoricsGraph TheoryLinear algebra·Captain: mikedeng1

A Deterministic Polynomial Kernel for Odd Cycle TransversalResearch Paper

An odd cycle transversal of a finite undirected graph is a set of vertices whose deletion leaves a graph that can be coloured with two colours, with adjacent vertices receiving different colours. The associated decision problem asks whether at most kkk deletions suffice. It is a basic example in parameterized graph algorithms: the graph may be large even when…

24 thms4 active usersReviewed
CombinatoricsLinear algebra·Captain: mikedeng1

Parity Decision Trees of Depth O(4dlog⁡∥f^∥1)O(4^d \log \| \widehat f \|_1)O(4dlog∥f​∥1​) for Boolean Functions fff of F2\mathbb F_2F2​-Degree dddResearch Paper

A parity decision tree computes a Boolean function by adaptively asking for the parity of selected input bits. This model allows a linear question to inspect many coordinates at once. It is useful in studying XOR communication problems: Alice knows a binary vector xxx, Bob knows a binary vector yyy, and both must determine f(x+y)f(x+y)f(x+y). A parity query about the sum…

23 thms4 active usersReviewed
Algorithmic Game Theory·Captain: mikedeng1

The Complexity of Nash Equilibrium in Network Congestion and Coordination GamesResearch Paper

Algorithmic game theory studies how to find stable outcomes when several decision makers interact. A Nash equilibrium is a profile of independent randomized choices in which no player can improve by changing their own choice. Network congestion games model players selecting routes whose costs increase with traffic. Network coordination games describe…

29 thms4 active usersReviewed
Information TheoryProbability·Captain: mikedeng1

Information Complexity of Inner Product and Matrix Multiplication via Shannon-to-Min-Entropy ConversionResearch Paper

A communication protocol lets two parties compute a function of inputs that they hold separately. Its messages can reveal information about those inputs, even when the answer itself is small. Researchers in communication complexity study this disclosure through information complexity: the least information that any correct protocol must reveal, with a…

25 thms4 active usersReviewed
CombinatoricsProbability·Captain: mikedeng1

A Counting and Sampling Lovász Local Lemma IIResearch Paper

The Lovász Local Lemma (LLL) states that a family of rare bad events with few dependencies can be avoided simultaneously with positive probability. Applied to a constraint satisfaction problem, it says that a formula has a solution when every constraint is violated with small probability and shares variables with few others. The algorithmic LLL (Moser–Tardos…

24 thms4 active usersReviewed
Algorithmic Game TheoryMechanism Design·Captain: mikedeng1

On the Complexity of Mixed Equilibria in First-Price Auctions with Correlated PriorsResearch Paper

A first-price auction awards a single item to a highest bidder and charges that bidder her own bid. Choosing a bid therefore involves predicting competitors' behavior. Researchers studying auction computation ask whether an equilibrium can be found efficiently from the publicly available description of bidders' information. The setting here allows their…

31 thms4 active usersReviewed
🏆Completed
Algebraic GeometryLinear algebra·Captain: mikedeng1

A Quadratic Lower Bound on Determinantal ComplexityResearch Paper

Determinantal representations are a basic model of algebraic computation. Valiant showed that every polynomial has one and made the size of the smallest such representation central to algebraic complexity, where proving a superpolynomial bound for the permanent is the algebraic analogue of P versus NP (Valiant 1979). Even super-linear bounds in the number…

20 thms4 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: queelius

Degree vs. sensitivity: beating the exponent log⁡6/log⁡3\log 6/\log 3log6/log3Open Problem

Sensitivity and polynomial degree are two of the basic complexity measures of a Boolean function. Huang (2019) proved deg⁡(f)≤s(f)2\deg(f) \le s(f)^2deg(f)≤s(f)2, settling the Sensitivity Conjecture (Annals of Mathematics 190(3)). In the other direction, s(f)≤deg⁡(f)2s(f) \le \deg(f)^2s(f)≤deg(f)2, and nobody knows whether this quadratic upper bound is tight. The largest known gap comes from one explicit…

16 thms4 active usersReviewed
cryptographyQuantum Information·Captain: iris

Computational Bounds for fff-RoutingResearch Paper

Quantum position verification aims to turn a device's physical location into a verifiable credential, with position-based authentication and key exchange as applications (Buhrman et al. 2014). The central question is whether several colluding devices elsewhere can impersonate a prover at the claimed location. The fff-routing protocol is a leading candidate.…

38 thms4 active usersReviewed
PreviousPage 4 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