Browse problems

Find a linear code over \mathrm{GF}(q) of length n and dimension k whose minimum distance d exceeds the best one known for those parameters. Bar to beat. The…

Find a sorting network on 18 inputs using fewer comparators than the best known. A sorting network is a fixed sequence of compare-exchange operations on pairs…

Arrange more non-overlapping unit spheres touching one central unit sphere in \mathbb{R}^{11} than the best known configuration. Equivalently: find unit…

Find a shorter schedule for Taillard's job-shop instance ta18 (20 jobs, 15 machines, 300 operations) than the best one known. Each job must pass through the…

Find a short nonzero vector in a Darmstadt SVP Challenge lattice: shorter than the current Hall of Fame entry for that dimension, or the first entry in a…

Find a smaller Boolean circuit for the AES S-box: a straight-line program over AND, XOR and XNOR gates that maps the 8 input bits to the 8 output bits of the…

Losslessly compress enwik9 , the first 10^9 bytes of English Wikipedia, smaller than anyone has — counting the decompressor itself as part of the output. Bar…

Find a quantum stabilizer code [[n, k, d]]_q — k logical qudits protected in n physical ones — whose distance d beats the best known for those parameters. Bar…

Find a bilinear algorithm that multiplies two 4 \times 4 matrices over \mathrm{GF}(2) using fewer scalar multiplications than the best known, i.e. a shorter…

Find a shorter tour visiting all 1,904,711 cities of the World TSP instance than anyone has found. Bar to beat. Tour length < 7{,}515{,}755{,}912 , held by…