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

Parallel Repetition for k-Player XOR GamesResearch Paper

Parallel repetition is the standard way to amplify the soundness of multi-prover interactive protocols without adding players or rounds. A verifier plays nnn copies of a one-round game at once and accepts only if every copy is won. The basic question is how fast the optimal winning probability falls with nnn. This matters for probabilistically checkable proofs…

15 thms1 active userReviewed
Captain: mikedeng1

Pseudodeterminism and MA != NP^BPP in Communication ComplexityResearch Paper

Two parties may each hold a long binary string while needing only a short conversation to decide a shared question. Communication complexity measures the number of bits they exchange, allowing unlimited local computation. An additional participant, Merlin, can send a proposed witness to both parties before their conversation. Merlin–Arthur communication perm…

20 thms1 active userReviewed
Graph Theory·Captain: mikedeng1

A Linear Lower Bound on Testing Graph Isomorphism in the Bounded-Degree ModelResearch Paper

A property tester examines a small part of a large object and distinguishes objects with a property from objects far from that property. For graph algorithms, this asks whether reading an entire graph is necessary even when an approximate decision would suffice. Fixed-graph isomorphism testing gives the algorithm a complete target graph in advance. Its only…

17 thms1 active userReviewed
Linear algebraTheoretical Computer Science·Captain: mikedeng1

A Degree–Size Relation for Resolution over PolynomialsResearch Paper

Propositional proof complexity asks how long a proof that a formula is unsatisfiable must be in a given proof system. Lower bounds for stronger systems bear on the limits of SAT solvers built on those systems, and algebraic proof systems were connected early on to bounded-depth Frege systems with modular counting (Buss et al., 1996). For ordinary…

18 thms1 active userReviewed
Linear algebraQuantum Information·Captain: mikedeng1

Bootstrapping Classical and Quantum Query Lower Bounds for Finding Tarski Fixed PointsResearch Paper

A fixed point is a state unchanged by a function. Fixed-point formulations occur in program analysis, verification and equilibrium computation. Their existence alone does not say how much information an algorithm must obtain to find one. This mission concerns the information required when a function is accessible only through queries on a finite grid. The…

29 thms1 active userReviewed
AlgebraLinear algebra·Captain: mikedeng1

Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed CyclesResearch Paper

A permutation monomial of a square matrix chooses one entry from each row and each column. The determinant adds these monomials with signs recording permutation parity. In a field of characteristic two, adding an element to itself gives zero, so minus one equals one. The determinant therefore gives the sum of all permutation monomials, but its signs no…

30 thms1 active userReviewed
CombinatoricsTheoretical Computer Science·Captain: iris

A Full Complexity Dichotomy for Complex-Valued Boolean Holant ProblemsResearch Paper

A counting problem asks for the weighted number of global configurations satisfying local constraints; a complexity dichotomy decides, for every choice of local rules, whether the problem is computable in polynomial time or #P-hard. Boolean Holant problems are the most general Boolean framework in which such classifications are pursued: they contain…

48 thms1 active userReviewed
AnalysisProbabilityQuantum Information·Captain: iris

Provable Quantum-Classical Separation for Continuous Gibbs SamplingResearch Paper

Sampling from a Gibbs distribution p∝e−βEp\propto e^{-\beta E}p∝e−βE is a basic primitive of statistical physics, Bayesian inference and optimization. For non-log-concave potentials the difficulty is governed by energy barriers: a sampler must cross regions where the density is a factor eβΔe^{\beta\Delta}eβΔ smaller than elsewhere. Quantum algorithms that act on the square…

65 thms1 active userReviewed
AlgebraAlgebraic GeometryInformation Theory+1·Captain: iris

Algorithmic List Decoding at Capacity and Optimal Proximity Gaps for Reed–Solomon CodesResearch Paper

A Reed–Solomon code of rate R=k/nR=k/nR=k/n consists of the evaluation vectors of polynomials of degree below kkk at nnn distinct points of a finite field Fq\mathbb F_qFq​ [RS60]. List decoding asks for every codeword within a given relative Hamming distance ρ\rhoρ of a received word. Information-theoretically, a code of rate RRR over a large alphabet can be list decoded up to…

26 thms1 active userReviewed
Quantum InformationTheoretical Computer Science·Captain: iris

Improved Separations between Quantum and Classical Communication Complexity of Total FunctionsResearch Paper

Quantum communication complexity asks how much two parties gain by exchanging qubits instead of bits. For total Boolean functions f:{0,1}n×{0,1}n→{0,1}f:\{0,1\}^n\times\{0,1\}^n\to\{0,1\}f:{0,1}n×{0,1}n→{0,1} the gap was long believed to be at most polynomial. Polynomial separations between randomized and quantum complexity were known, the largest being R(f)≥Q(f)3−o(1)R(f)\ge Q(f)^{3-o(1)}R(f)≥Q(f)3−o(1) (Bansal–Sinha;…

30 thms1 active userReviewed
Information TheoryProbabilityTheoretical Computer Science·Captain: iris

Non-Interactive Cryptography over Noisy Channels from Indistinguishability ObfuscationResearch Paper

A noisy channel produces randomness that no party chose and no party fully observes. Wyner's wiretap channel (Wyner 1975) used this to send a message confidentially without a shared key, and a long line of work showed that noise is a resource for secure computation as well. One-way communication is the setting where this resource matters most: a sender…

57 thms1 active userReviewed
Quantum InformationRandom Matrix TheoryTheoretical Computer Science·Captain: iris

Lower Bounds for Preprocessing Attacks on Quantum CryptographyResearch Paper

Cryptographic hash functions are analysed in the random oracle model, where the hash is a uniformly random function RRR that every party may query. An attacker who knows the hash function in advance may spend unbounded time precomputing advice about RRR before it sees its challenge; security against such preprocessing attacks (non-uniform security) is what…

36 thms1 active userReviewed
Information Theory·Captain: iris

Asymmetry and Complexity of Nondeterministic ComputationsResearch Paper

Meta-complexity studies the computational complexity of computing Kolmogorov complexity itself: how hard is it, given a string xxx and a threshold sss, to decide whether xxx has a short description? The question connects circuit lower bounds, pseudorandomness, learning and cryptography, and lower bounds for such problems are among the few unconditional lower…

61 thms1 active userReviewed
cryptographyTheoretical Computer Science·Captain: iris

From Degree Three to Degree Two: Statistical Randomized Encodings for All FunctionsResearch Paper

A randomized encoding of a function fff replaces f(x)f(x)f(x) by a randomized value f^(x;r)\hat f(x;r)f^​(x;r) from which f(x)f(x)f(x) can be decoded and which reveals nothing else about xxx. Encodings are useful when f^\hat ff^​ is much simpler than fff, and in secure multiparty computation the relevant measure of simplicity is the algebraic degree of f^\hat ff^​ over F2\mathbb F_2F2​, jointly in the input…

31 thms1 active userReviewed
Representation TheoryTheoretical Computer Science·Captain: iris

Group Action and Spin Representation Lead to a Holant* Complexity Dichotomy on Domain Size 3Research Paper

Counting problems such as counting perfect matchings, edge colourings or weighted graph homomorphisms can all be written as Holant problems: one sums, over all assignments of domain values to the edges of a graph, the product of local constraint functions at the vertices. Complexity theory asks for a dichotomy: a criterion on the constraint functions that…

30 thms1 active userReviewed
Mathematical LogicTheoretical Computer Science·Captain: iris

Synergies between Proof Complexity and CryptographyResearch Paper

A central question in cryptography is whether problems with the structure of NP∩coNP\mathsf{NP}\cap\mathsf{coNP}NP∩coNP must be hard if strong cryptography exists. Factoring and discrete logarithm lie in that class, while indistinguishability obfuscation (iOi\mathcal OiO), together with one-way functions, yields much of standard cryptography from an apparently unstructured…

58 thms1 active userReviewed
Theoretical Computer Science·Captain: iris

Solving One of Many Instances Is Almost as Hard as Solving OneResearch Paper

A direct-sum theorem says that solving many independent instances of a communication problem costs proportionally more than solving one (Feder, Kushilevitz, Naor, Nisan 1995; Karchmer, Raz, Wigderson 1995). A strong direct-sum theorem would imply something weaker and still informative: solving one of kkk instances is almost as hard as solving a single…

27 thms1 active userReviewed
Theoretical Computer Science·Captain: iris

Trading Time, Space, and Alternations: General Plasticity for Algorithms from Hardness of Range AvoidanceResearch Paper

Whether polynomial time can be simulated in small space is one of the central questions of complexity theory. A simulation of P\mathrm{P}P in space nγn^{\gamma}nγ for every γ>0\gamma>0γ>0 would imply P≠PSPACE\mathrm{P}\neq\mathrm{PSPACE}P=PSPACE by the space hierarchy theorem. Williams gave an unconditional simulation of time TTT in space about T\sqrt TT​ (Wil25), and asking for much less…

99 thms1 active userReviewed
ProbabilityTheoretical Computer Science·Captain: iris

Targeted SamplersResearch Paper

A randomized algorithm that runs in time TTT and uses TTT random bits usually errs on some fraction of its random strings. Derandomization asks for a deterministic algorithm with the same answers, and fine-grained derandomization asks that the deterministic algorithm be almost as fast, in time T1+O(ϵ)T^{1+O(\epsilon)}T1+O(ϵ) rather than poly(T)\mathrm{poly}(T)poly(T). Without a generic…

47 thms1 active userReviewed
Information TheoryTheoretical Computer Science·Captain: iris

Resolving the Worst-Case Complexity of Linear Secret SharingResearch Paper

A secret-sharing scheme lets a dealer split a secret among nnn parties so that every authorized coalition can recover it, while every other coalition learns nothing about it. Since Shamir and Blakley introduced threshold schemes in 1979, and Ito, Saito and Nishizeki showed in 1987 that every monotone family of coalitions can be realized, the central…

15 thms1 active userReviewed
Markov ChainProbabilityTheoretical Computer Science·Captain: iris

Efficient Stable Word-RAM Simulation by Population ProtocolsResearch Paper

Population protocols model computation by many identical, anonymous agents with small memory that interact in randomly chosen pairs: chemical reaction networks, sensor swarms, molecular programming AAD+06. Inputs and outputs are unary counts of agents in designated states. With a constant number of states, the predicates that can be computed stably (correctl…

31 thms1 active userReviewed
Theoretical Computer Science·Captain: iris

Average-Case Hardness of PH from ETH-Type HypothesesResearch Paper

Average-case complexity asks whether problems are hard on the inputs that an efficient process actually generates, rather than on the worst input. It is the setting that cryptography needs, and Impagliazzo's survey Imp95 named the world in which NP is hard in the worst case and easy on average "Heuristica". A central question is what worst-case assumptions…

76 thms1 active userReviewed
Theoretical Computer Science·Captain: iris

Exponential Lower Bounds for Products of Cubic Polynomials over Prime FieldsResearch Paper

How complicated must a modular predicate be when it is written as a product of low-degree polynomials over a prime field? The question comes from circuit complexity. The polynomial method of Razborov and Smolensky gives strong lower bounds for bounded-depth circuits when the algebra and the gate modulus are compatible (Razborov 1987, Smolensky 1987).…

44 thms1 active userReviewed
Mathematical LogicTheoretical Computer Science·Captain: iris

Resolution Lower Bounds versus the Weak Pigeonhole PrincipleResearch Paper

Automatability asks whether a proof system can find proofs in time polynomial in the size of the shortest one. Atserias and Müller showed that Resolution is not automatable unless P = NP (JACM 2020). Their argument rests on the CNF formulas Refs(φ)\mathrm{Ref}_s(\varphi)Refs​(φ), which say that φ\varphiφ has a Resolution refutation with few clauses: for unsatisfiable φ\varphiφ…

19 thms1 active userReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: iris

A dichotomy theorem for approximating CSPs in random-order streamsResearch Paper

A constraint satisfaction problem asks for an assignment of letters to variables satisfying as many given constraints as possible. In the single-pass streaming model, constraints arrive one at a time and an algorithm keeps limited memory between them. Classification results describe how approximation quality trades against memory when an adversary chooses…

37 thms1 active userReviewed
PreviousPage 16 of 17Next

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