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

Tight Lower Bounds for Differentially Private Continual CountingResearch Paper

A running count reports how many ones have appeared in a binary stream after each arrival. Releasing these counts privately is a basic instance of repeated statistical reporting: a single input bit contributes to many answers, so privacy must protect the complete vector of releases. Continual counting also serves as a privacy primitive in learning…

19 thms5 active usersReviewed
Quantum Information·Captain: mikedeng1

No size-preserving amplification with quantum adviceResearch Paper

Error reduction asks how much additional computation is needed to make a randomized or quantum algorithm more reliable. With auxiliary quantum information, its size is a separate resource. Quantum advice is a state that may depend on the input length but must support every input of that length. Keeping the number of advice qubits fixed asks whether an…

25 thms5 active usersReviewed
Computational Complexity·Captain: mikedeng1

Submodularity Is Barely TestableResearch Paper

A value oracle returns the value of a set function at a requested subset. Algorithms using such an oracle often rely on a global mathematical promise while observing only a small fraction of the function's values. Submodularity testing asks how much information is needed to check one such promise: diminishing marginal returns. This matters when a guarantee…

28 thms5 active usersReviewed
Complexity TheoryInformation Theory·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
CombinatoricsQuantum Information·Captain: iris

Spectrum Estimation is Almost as Hard as TomographyResearch Paper

A ddd-dimensional quantum state is a density matrix ρ∈Cd×d\rho\in\mathbb C^{d\times d}ρ∈Cd×d: positive semidefinite with trace 111. Its eigenvalues form a probability distribution, the spectrum of ρ\rhoρ, which determines every unitarily invariant property of the state: its von Neumann entropy, its purity, its rank. Spectrum estimation asks how many identical copies of an…

51 thms5 active usersReviewed
Harmonic AnalysisNumber TheoryProbability·Captain: iris

When Masks Leak Their Weight: From Additive Sharing to Learning with Physical RoundingResearch Paper

Masking protects a secret held by a physical device by splitting it into random additive shares that sum to the secret modulo NNN; each share alone is uniformly distributed. In practice the device leaks a noisy function of every share it touches, and the standard model of that leakage on CMOS hardware is the Hamming weight of the share: the number of ones in…

41 thms5 active usersReviewed
CombinatoricsComplexity TheoryProbability·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 thms5 active usersReviewed
Machine LearningOperations ResearchOptimization·Captain: iris

Computational Complexity of Data-Driven Configuration for Integer Programming, Clustering, and Learning AlgorithmsResearch Paper

Integer programming solvers expose parameters, and in practice they are run on many instances of one application. Data-driven algorithm configuration asks for parameters that perform well on a training set of instances. For cutting planes, Balcan, Prasad, Sandholm and Vitercik (2021) bound the sample complexity of tuning Chvátal–Gomory cuts: how many…

55 thms5 active usersReviewed
Complexity TheoryQuantum Information·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
Convex OptimizationMarkov ChainProbability·Captain: iris

Polytope Sampling at the Speed of IsoperimetryResearch Paper

Drawing a point uniformly at random from a polytope X={x∈Rn:Ax<b}\mathcal X=\{x\in\mathbb R^n: Ax<b\}X={x∈Rn:Ax<b} given by mmm linear inequalities is a basic primitive of high-dimensional computation. It is the inner loop of randomized volume computation and integration over convex sets, and it is used directly in systems biology (sampling flux polytopes of metabolic networks),…

35 thms5 active usersReviewed
Complexity Theory·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
CombinatoricsDiscrete GeometryProbability·Captain: iris

Robust Exact Realization of Pairwise Boolean StatisticsResearch Paper

Suppose a data set consists of distinct binary rows of length nnn. Its basic statistics are the number of rows, each column sum, and each pairwise co-occurrence count. Given integer values for these statistics, can a set of rows be constructed that realizes them exactly? Equivalently: given the degree-at-most-two statistics of a Boolean function, construct a…

25 thms5 active usersReviewed
Complexity Theory·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
Complexity Theory·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…

51 thms5 active usersReviewed
AlgebraCombinatoricsComplexity Theory·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
Complexity Theory·Captain: iris

d-DNNF is Not Polynomially Closed Under NegationResearch Paper

Deterministic decomposable negation normal form circuits (d-DNNFs) are a central target language of knowledge compilation: a d-DNNF supports exact model counting, weighted model counting and sampling in time polynomial in its size (Darwiche–Marquis 2002). Compiling a CNF into a d-DNNF and then counting is a standard approach to #SAT, and d-DNNFs are used…

52 thms5 active usersReviewed
Complexity TheoryGraph Theory·Captain: iris

Improved NP-Hardness of Approximation for Max-3-Cut and for Max-k-Cut with Small kResearch Paper

In Max-kkk-Cut one is given a graph with non-negative edge weights and must colour its vertices with kkk colours so as to maximise the total weight of the edges whose endpoints receive different colours. For k=2k = 2k=2 this is Max-Cut. For k≥3k \ge 3k≥3 the best polynomial-time algorithms round the semidefinite relaxation of Frieze and Jerrum (Algorithmica 1997); for k=3k = 3k=3…

54 thms5 active usersReviewed
Quantum Information·Captain: iris

On the pseudorandomness of simple quantum processesResearch Paper

A pseudorandom unitary ensemble is one that no efficient quantum algorithm can tell apart from the Haar measure. Such ensembles underlie quantum cryptography and are used as models of chaotic many-body dynamics. A weaker, purely statistical property is being an approximate unitary ttt-design: the ensemble reproduces the first ttt moments of the Haar measure.…

47 thms5 active usersReviewed
Convex OptimizationLinear algebraOptimization·Captain: iris

A Fast Lewis-weight Interior-Point Method for Linear Optimization over Product Convex SetsResearch Paper

Many problems in statistics, control and data science minimize a linear objective over a product of small convex sets subject to a few linear equations: ℓp\ell_pℓp​ regression, entropy-regularized transport, and second-order cone programs with small cones. When the number of variables nnn is much larger than the number of equations ddd, the running time in terms of ddd…

27 thms5 active usersReviewed
Complexity TheoryGraph TheoryOperations Research·Captain: iris

Approximation and Hardness for the Data Validation ProblemResearch Paper

Precedence-constrained scheduling takes a partial order on tasks as input, yet in practice the order is rarely known with full confidence. In product design, assembly, project scheduling and construction, the relation between two tasks is often not documented, and an expert must be consulted to determine it. For automotive assembly, probing direct…

36 thms5 active usersReviewed
Convex OptimizationLinear algebraOptimization·Captain: iris

Adaptive Matrix Sparsification with Applications to Empirical Risk Minimization and Computational GeometryResearch Paper

Empirical risk minimization (ERM) is a convex optimization problem that covers linear and ℓp\ell_pℓp​ regression, LASSO, logistic regression, support vector machines and quantile regression. Its dual form is

28 thms5 active usersReviewed
Complexity TheoryConvex Optimization·Captain: iris

Near-Quadratic Lower Bounds for Convex Optimization with Binary First-Order QueriesResearch Paper

Classical oracle complexity counts how many exact first-order answers — a value f(y)f(y)f(y) and a subgradient g∈∂f(y)g\in\partial f(y)g∈∂f(y) — a method needs to minimize a convex function. With exact real answers, O(dlog⁡(MR/ε))O(d\log(MR/\varepsilon))O(dlog(MR/ε)) queries suffice in dimension ddd, attained by the center of gravity method and by modern cutting-plane methods. A computer, however, reads…

62 thms5 active usersReviewed
Operations ResearchProbability·Captain: iris

Order-Optimal Correlated Rounding for Fulfilling Multi-Item E-Commerce Orders: Algorithm 1 Is a (1+ln⁡q)(1 + \ln q)(1+lnq)-Competitive Rounding Scheme with Runtime O(qK)O(qK)O(qK)Research Paper

An online retailer that holds inventory in many fulfillment centres (FCs) decides, for each item of an order, where to ship it from. A linear program solved over all orders gives, for each item, a probability distribution over FCs that is right on average. The difficulty is correlation: items sent to different FCs ship in separate packages, so an order is…

22 thms5 active usersReviewed
AlgebraCombinatoricsInformation Theory·Captain: mikedeng1

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data 2: The Improved Juels–Sudan Sketch Is an Average-Case Secure Sketch for s-Element Sets with Entropy Loss t log nResearch Paper

Many security-relevant inputs are noisy and do not repeat exactly: fingerprint minutiae, iris codes, lists of personal preferences, the set of features extracted from a document. A cryptographic key derived from such an input must be reproducible from a later, slightly different reading, without storing the input itself. Dodis, Ostrovsky, Reyzin and Smith (S…

11 thms5 active users
PreviousPage 2 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