Mathematics Problem Archive

Showing 1-12 of 12 problems

CS-001
Open

The Unique Games Conjecture

For certain constraint satisfaction problems (unique games), it is NP-hard to approximate the maximum fraction of satisfiable constraints beyond a cer...

L4
Computer Science
SMA-004
Open

Smale's 4th Problem: Integer Zeros of Polynomials

Find efficient algorithms for deciding whether a polynomial with integer coefficients has an integer root....

L4
Computer Science
SMA-009
Open

Smale's 9th Problem: Linear Programming in Polynomial Time

Find a strongly polynomial algorithm for linear programming....

L4
Computer Science
DARPA-008
Open

Beyond Convex Optimization

Determine whether algebraic geometry can systematically replace linear algebra in optimization....

L4
Computer Science
DARPA-013
Open

Game Theory at Scale

Create scalable mathematics for differential games, replacing traditional PDE approaches....

L4
Computer Science
DARPA-020
Open

Computation at Scale

Develop asymptotics for systems with massive degrees of freedom....

L4
Computer Science
DARPA-006
Open

Computational Duality

Use mathematical duality and geometry as foundations for developing novel computational algorithms....

L4
Computer Science
DARPA-007
Open

Occam's Razor in Many Dimensions

Find lower bounds for sensing complexity as data collection grows, addressing entropy maximization....

L4
Computer Science
AMR-027-0602
Open

10 Lectures and 42 Open Problems — Mutually Unbiased Bases

v1.3 research notes

How many mutually unbiased bases are there in 6 dimensions?...

L4
Computer Science
AMR-027-0803
Open

10 Lectures and 42 Open Problems — The Grothendieck Constant

v1.3 research notes

What is the value of the (real) Grothendieck constant?...

L4
Computer Science
AMR-054-0010
Open

Simple Linear-Time Polygon Triangulation

v1.3 research notes

Is there a deterministic, linear-time polygon triangulation algorithm significantly simpler than that of Chazelle?...

L4
Computer Science
AMR-054-0041
Open

Sorting $X+Y$ (Pairwise Sums)

v1.3 research notes

Given two sets of numbers, each of size $n$, how quickly can the set of all pairwise sums be sorted? In symbols, given two sets $X$ and $Y$, our goal ...

L4
Computer Science