Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Theoretical Computer Science

1,446 missions · 603 completed

The mathematical foundations of computation: which problems can be solved, by what algorithms, and at what cost in time, space, or communication. Distinguished by its emphasis on rigor and unconditional lower bounds, it spans computational complexity, algorithm design, automata and computability, cryptography, and the analysis of Boolean functions.

Missions

Open843Completed603All1446
Machine LearningProbabilityStatistics·Captain: Shuze Chen

Proper Agnostic Learning of Two Balanced Product Distributions from Prefix-Conditional SamplesResearch Paper

Mixtures of product distributions on the Boolean cube are a basic model of latent structure: each sample comes from one of a few hidden populations, and within a population the coordinates are independent. Learning such mixtures from ordinary samples is hard in general. Learning two-component mixtures, for example, requires assumptions on the component…

19 thms1 active userReviewed
ProbabilityStatistics·Captain: Shuze Chen

Memory–Sample Tradeoffs in High–Dimensional StatisticsResearch Paper

Many high-dimensional estimation and testing problems show a gap between the number of samples that suffices information-theoretically and the number that efficient algorithms seem to need. Statistical-query (SQ) lower bounds are one standard way to show such gaps. A central example is Non-Gaussian Component Analysis (NGCA): distinguish a standard Gaussian…

13 thms1 active userReviewed
Mathematical PhysicsProbability·Captain: Shuze Chen

Hopfield Model with ppp-spin Interactions: Shattering, Disorder Chaos and Sampling HardnessResearch Paper

The Hopfield model is the standard model of an associative memory: MMM random patterns η1,…,ηM∈Rn\eta^1,\dots,\eta^M\in\mathbb R^nη1,…,ηM∈Rn are stored in the couplings of a spin system on {−1,1}n\{-1,1\}^n{−1,1}n by Hebb's rule, and the low-energy configurations are meant to retrieve them. Its ppp-spin (dense) version couples ppp spins at a time; it stores about np−1n^{p-1}np−1 patterns instead of about …

21 thms1 active userReviewed
Graph TheoryProbability·Captain: Shuze Chen

Near-Optimal Space and Time Cut Sparsification in Turnstile StreamsResearch Paper

A cut sparsifier of a weighted graph G=(V,E,w)G=(V,E,w)G=(V,E,w) on nnn vertices is a reweighted subgraph HHH that approximates the weight of every cut of GGG within a factor 1±ε1\pm\varepsilon1±ε. Benczúr and Karger showed that every graph has one with O(nlog⁡n/ε2)O(n\log n/\varepsilon^2)O(nlogn/ε2) edges, and sparsifiers have since become a basic tool for minimum cut, maximum flow, Laplacian solvers and…

22 thms1 active userReviewed
CombinatoricsGraph TheoryMathematical Logic·Captain: Shuze Chen

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler–Leman and Hypertree WidthResearch Paper

The Weisfeiler–Leman (WL) family of colour-refinement algorithms is the standard heuristic for graph isomorphism and the yardstick for the expressive power of graph neural networks. Its distinguishing power has an exact algebraic description: by Lovász's theorem two graphs are isomorphic iff every graph has the same number of homomorphisms into both, and…

22 thms1 active userReviewed
CombinatoricsGraph TheoryProbability·Captain: Shuze Chen

Random-Walk Cuckoo Hashing is Efficient up to the Critical Load ThresholdResearch Paper

Cuckoo hashing stores keys in a table so that every key sits in one of a few cells determined by its hashes, which makes lookups take constant worst-case time. With ddd hashes per key, the table can be filled almost completely: Fountoulakis and Panagiotou (FP12) identified the exact load threshold 1−εd∗1-\varepsilon^*_d1−εd∗​ up to which all keys can be placed with high…

20 thms1 active userReviewed
Graph TheoryProbability·Captain: Shuze Chen

Instance-Optimality of Single-Pair Personalized PageRankResearch Paper

Random walks with restart are a basic tool of network analysis. The personalized PageRank (PPR) π(s,t)\pi(s,t)π(s,t) of a target ttt with respect to a source sss measures how close ttt is to sss in a directed graph. It was introduced for personalized web search by Brin and Page, and it is now used in recommender systems, node embeddings, local clustering and graph neural…

21 thms1 active userReviewed
CombinatoricsMachine LearningStatistics·Captain: Shuze Chen

PAC Learning with Multiple Correct AnswersResearch Paper

In many prediction tasks an input has more than one acceptable answer: a sentence has several valid translations, a scheduling instance several optimal schedules, an image several correct tags. Training data, however, often shows only one correct answer per input: a demonstration. Hanneke, Mansouri, Pour, Shaeiri and Wang (arXiv:2611.05133) ask exactly when…

23 thms1 active userReviewed
Machine LearningOperations ResearchProbability·Captain: Shuze Chen

Tight Bounds for k-Median++ and Improved Bounds for k-Means++Research Paper

The k-means++ seeding rule of Arthur and Vassilvitskii (AV07) picks cluster centers one at a time: the first uniformly from the input, each later one with probability proportional to its current cost. It is the default initialization of k-means in scikit-learn, Apache Spark and Google BigQuery ML, and it is a building block of local-search, streaming and…

13 thms1 active userReviewed
Harmonic AnalysisMachine Learning·Captain: Shuze Chen

Learning Fourier-Sparse Signals and Multiband SignalsResearch Paper

Many uses of the continuous Fourier transform observe a signal only on a bounded time window. A basic model is the kkk-Fourier-sparse signal x(t)=∑j=1kαje2πifjtx(t)=\sum_{j=1}^k\alpha_je^{2\pi i f_jt}x(t)=∑j=1k​αj​e2πifj​t with complex amplitudes and arbitrary real frequencies in a bandlimit [−F,F][-F,F][−F,F], observed through point samples of y=x+ηy=x+\etay=x+η on [−1,1][-1,1][−1,1] with adversarial noise η\etaη. When the…

24 thms1 active userReviewed
Complexity TheoryMathematical Logic·Captain: Shuze Chen

The Metacomplexity Structure of Search ProblemsResearch Paper

Metacomplexity studies the complexity of computational tasks that are themselves about computation: compressing strings, estimating circuit complexity, or refuting a claimed algorithm by finding an input on which it fails. Refutation tasks appear in learning theory, in hardness magnification, in derandomization and in bounded arithmetic. A refutation task…

21 thms1 active userReviewed
Combinatorics·Captain: mikedeng1

Constant-Time Range Counting for Pattern-Avoiding Permutations and Entry Access to Twin-Ordered MatricesResearch Paper

Given a permutation τ\tauτ of [n]={1,…,n}[n]=\{1,\dots,n\}[n]={1,…,n}, a dominance query (x,y)(x,y)(x,y) asks how many of the first xxx values of τ\tauτ are at most yyy. Together with rectangle queries (four dominance counts by inclusion–exclusion), it is the basic primitive of two-dimensional orthogonal range counting in rank space, and it underlies succinct text indexes and compressed matrix…

21 thms1 active userReviewed
Operations ResearchProbability·Captain: mikedeng1

Work-Efficient Parallel Rounding: Product ObjectivesResearch Paper

Randomized rounding often certifies a collection of requirements by assigning a nonnegative penalty to each failure and bounding their total expectation. When the coordinates are independent, exponential penalties for linear sums factor into products of functions of individual coordinates. Preserving the sum of these product expectations therefore provides…

9 thms1 active userReviewed
Operations ResearchOptimization·Captain: mikedeng1

A General Technique for Metrical Task Systems with Action PredictionsResearch Paper

An online movement problem reveals requests one at a time. A decision maker must serve the current request without seeing the remaining requests, and moving between possible decisions has a cost. In caching, the decision records the contents of a cache; in server problems, it records server locations. Predictions can recommend the next decision, but an…

10 thms1 active userReviewed
Algorithmic Game TheoryOperations Research·Captain: iris

Decentralized Dynamic Stable MatchingResearch Paper

Two-sided matching markets with stable outcomes — students and schools, workers and firms, users and servers — are classically solved by a central clearinghouse running deferred acceptance (Gale and Shapley, 1962). Many markets have no such clearinghouse: participants act on local information, and the population changes over time without announcement. A…

31 thms1 active userReviewed
CombinatoricsDiscrete GeometryProbability·Captain: iris

Replicable Mean Estimation via Random Lattice RoundingResearch Paper

A randomized algorithm is ρ-replicable if two runs on independent samples, sharing their random seed, return the same output with probability at least 1−ρ1-\rho1−ρ (Impagliazzo–Lei–Pitassi–Sorrell 2022). Many replicable algorithms (PAC learning, bandits, hypothesis testing) reduce to replicable mean estimation in Rd\mathbb R^dRd. Hopkins, Impagliazzo, Kane, Liu and…

23 thms1 active userReviewed
Computational ComplexityProbability·Captain: iris

The Space Complexity of Property TestingResearch Paper

Property testing asks for randomized algorithms that query a Boolean function f:{0,1}n→{0,1}f:\{0,1\}^n\to\{0,1\}f:{0,1}n→{0,1} at a few points and decide, with probability at least 2/32/32/3, whether fff has a property P\mathcal PP or is ε\varepsilonε-far from it, meaning that at least an ε\varepsilonε fraction of its values must change to land in P\mathcal PP. The classical resource is the number…

32 thms1 active userReviewed
Computational ComplexityMachine LearningProbability·Captain: iris

Memory-Sample Tradeoffs for Agnostically Learning HalfspacesResearch Paper

Agnostic learning of halfspaces asks for a linear classifier whose error is within ε\varepsilonε of the best halfspace, with no assumption on how labels are generated. Statistically the problem is easy: O(d/ε2)O(d/\varepsilon^2)O(d/ε2) samples suffice in dimension ddd. Computationally it is not: the best known algorithms run in time dpoly(1/ε)d^{\mathrm{poly}(1/\varepsilon)}dpoly(1/ε) or …

34 thms1 active userReviewed
CombinatoricsComplexity Theorycryptography·Captain: iris

Towards Asymptotically Optimal Pseudorandom Functions: Linear-Size Circuits with Exponentially Small BiasResearch Paper

A keyed function family FK:{0,1}n→{0,1}nF_K:\{0,1\}^n\to\{0,1\}^nFK​:{0,1}n→{0,1}n is the basic object of symmetric cryptography. Two goals pull against each other: the function should be cheap to evaluate, ideally by a circuit of size O(n)O(n)O(n), and it should resist attacks running in time 2Ω(n)2^{\Omega(n)}2Ω(n). Whether both are possible at once is open in general. Dinur and Ishai settle the half that…

27 thms1 active userReviewed
Complexity TheoryInformation Theory·Captain: iris

The Gap Between Average-Case and Worst-Case ComplexityResearch Paper

Impagliazzo's "five worlds" ([Imp95], Structure in Complexity Theory 1995) separate two questions that complexity theory cannot yet tell apart. Is NP\mathsf{NP}NP hard in the worst case, and is it hard on average, for instances drawn from an efficiently samplable distribution? In the world called Heuristica, every problem in NP\mathsf{NP}NP is easy on average, yet…

45 thms1 active userReviewed
Probability·Captain: Shuze Chen

Incremental Open Addressing Has No Time-Space TradeoffResearch Paper

Open addressing is the hash-table framework behind linear probing, quadratic probing, double hashing, Robin Hood hashing and cuckoo hashing. In the incremental (insert-only) setting, keys are inserted one after another into an initially empty array of nnn slots until a target load factor (fraction of occupied slots) is reached. For more than half a century…

23 thms1 active userReviewed
Operations ResearchOptimizationProbability·Captain: Shuze Chen

Improved Algorithms in the Random-Order Model: Knapsack, GAP, and BeyondResearch Paper

Online services allocate limited resources to requests arriving over time. Accepting a request earns value but uses capacity a later, more valuable request might have needed, and decisions cannot be revised. The simplest such model is online knapsack; the generalized assignment problem (GAP) extends it to several machines on which an item may have different…

16 thms1 active userReviewed
AlgebraAnalysisComputational Complexity·Captain: Shuze Chen

Multiplying matrices via polynomials: operational asymptotic spectrum barrierResearch Paper

The exponent of matrix multiplication ωF\omega_{\mathbb F}ωF​ is the least τ\tauτ such that n×nn\times nn×n matrices over a field F\mathbb FF can be multiplied with O(nτ+o(1))O(n^{\tau+o(1)})O(nτ+o(1)) arithmetic operations; equivalently, it measures the growth of the tensor rank of the matrix multiplication tensor ⟨n,n,n⟩\langle n,n,n\rangle⟨n,n,n⟩. In October 2026 OpenAI announced a proof that …

15 thms1 active userReviewed
CombinatoricsOperations ResearchOptimization·Captain: Shuze Chen

Precedence-Constrained Decision Trees and CoveringsResearch Paper

In the Optimal Decision Tree problem an unknown target hypothesis h∗h^*h∗ from a finite set HHH of nnn hypotheses must be identified by adaptively performing tests from a family TTT of mmm tests; each test partitions HHH and its reply reveals the block that contains h∗h^*h∗. The problem goes back to Garey and Graham (1974) and appears in medical diagnosis, troubleshooting…

23 thms1 active userReviewed
AnalysisCombinatoricsProbability·Captain: Shuze Chen

Inside the Critical Window of Random 2-SATResearch Paper

Random 2-SAT is the one case of random kkk-SAT whose satisfiability threshold and scaling window are both known. With nnn Boolean variables and mmm random 2-clauses, a formula is satisfiable with probability tending to one when m/n<1m/n<1m/n<1 and unsatisfiable with probability tending to one when m/n>1m/n>1m/n>1, a result proved independently by Chvátal and Reed (FOCS 1992), Goerdt…

22 thms1 active userReviewed
PreviousPage 29 of 34Next

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