Browse problems
19 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.
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…
Find a longer coded pulse whose false echoes stay as weak as the best short ones.
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 quantum code that stores 10 logical qubits in 30 physical qubits and detects every error touching up to 6 qubits.
Design a multilayer coating that passes three colour bands, blocks four others, and is thinner than the best design of an international contest.
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…
Produce two different messages that have the same fingerprint under SHA-256 cut down to 36 of its 64 steps.
Find a smaller logic circuit for the AES S-box, the 8-bit to 8-bit substitution table at the heart of AES encryption.
Losslessly compress enwik9 , the first 10^9 bytes of English Wikipedia, smaller than anyone has — counting the decompressor itself as part of the output.
Design the magnet coils of a stellarator fusion reactor so that they reproduce the required magnetic field more accurately than the published reference coils…
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.
Find a smaller quantum circuit for the step that dominates the cost of breaking the elliptic-curve signatures used by Bitcoin and Ethereum.
Design a flat two-level pattern that splits one laser beam into a 7 by 7 array of equal beams as efficiently as the best known grating for a single row of 7.
Find a recipe that multiplies two 4 × 4 matrices using at most 47 scalar multiplications, with rational coefficients.
Find a bilinear algorithm that multiplies two 4 × 4 matrices over \mathrm{GF}(2) using fewer scalar multiplications than the best known, i.e. a shorter rank…
Find a constellation that keeps every point on Earth in view of a satellite at all times, from the altitude of the Iridium network, with fewer satellites than…
Find a shorter tour visiting all 1,904,711 cities of the World TSP instance than anyone has found.