Top Open Problems
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
5,373 records · Search and filter
- Math-2951 No infinite critical clusters for three-dimensional site and bond percolation
- Math-2952 Finite conditional resolution of critical planar Ising stopping bands
- Math-2953 Height-averaged logarithmic bridge-length windows for critical honeycomb self-avoiding walks
- Math-2954 The Bochner-Riesz conjecture in dimension three
- Math-2955 Endpoint gradient regularity of the planar disk maximal operator
- Math-2956 Critical L3 local smoothing in three dimensions
- Math-2957 Diagonal extension from positively curved surfaces in R3
- Math-2958 Avoiding every dyadic affine sequence in a large-measure set
- Math-2959 Almost everywhere Fourier convergence for L log L
- Math-2960 Avoiding every geometric affine sequence in a large-measure set
- Math-2961 Hausdorff dimension of four-dimensional Kakeya sets
- Math-2962 Three-dimensional Kakeya maximal estimate
- Math-2963 The inverse-first-power universal integral-means spectrum
- Math-2964 Nearly minimal Littlewood maxima with positive minima
- Math-2965 Uniformly flat real Littlewood polynomials
- Math-2966 Rigidity of circle domains with removable boundary
- Math-2967 Schrodinger convergence at the higher-dimensional endpoint
- Math-2968 Planar Schrodinger convergence at H one-third
- Math-2969 Sharp L-infinity extension from the two-sphere
- Math-2970 Annular variation of the triangular Hilbert transform
- Math-2971 The symmetric maximal triangular Hilbert transform
- Math-2972 Balanced L3 boundedness of the trilinear Hilbert transform
- Math-2973 Polynomial switch-chain mixing for all degree sequences
- Math-2974 Matrix-multiplication improvement over every field
- Math-2975 Exact uniform sampling of arbitrary-margin contingency tables
- Math-2976 Bounded additive gap for the bin-packing configuration LP
- Math-2977 FPRAS for cell-bounded contingency tables
- Math-2978 FPRAS for common integer polymatroid bases
- Math-2979 FPRAS for common matroid bases
- Math-2980 Complex square and rectangular multiplication bounds
- Math-2981 Complex matrix multiplication at exponent nine-fourths
- Math-2982 Hellinger contraction with biased Boolean outputs
- Math-2983 Sharp binary-channel information contraction on the cube
- Math-2984 Constant-factor hardness of directed feedback vertex set
- Math-2985 Almost-linear edit-distance approximation scheme
- Math-2986 Counting-hierarchy upper bound for existential-universal real sentences
- Math-2987 Explicit super-square-root-exponential depth-three circuits
- Math-2988 Memory–precision lower bounds for exact Gaussian regression
- Math-2989 Unconditional time lower bounds for fixed-dimensional WL
- Math-2990 FPRAS for perfect matchings in general graphs
- Math-2991 Quasipolynomial trace samples for arbitrary symbols
- Math-2992 Depth-five homogeneous lower bounds for iterated matrix multiplication
- Math-2993 Integer multiplication below n log n
- Math-2994 Exponential semidefinite complexity for perfect matching
- Math-2995 Optimal Max-Cut approximation hardness
- Math-2996 Quasipolynomial mean-payoff/parity winning sets
- Math-2997 Metric k-median at factor one plus two over e
- Math-2998 Metric k-median strictly below factor two
- Math-2999 Constant-factor hardness of Min-UnCut
- Math-3000 Hitting lists for noncommutative rational formulas