OP-6991Algorithms and data structuresOpen
Worst exact path-compression cost in 64 union-find operations
TheoremDB P3760 · algorithms
TheoremDB· Source catalogue assessment
The index
TheoremDB
41 entries matching the current filters. Sorted by recently added.
OP-6990Algorithms and data structuresOpen
Worst augmentation count for lexicographic Edmonds-Karp on eight vertices
TheoremDB P3746 · algorithms
TheoremDB· Source catalogue assessment
OP-6913Computational complexityOpen
Unique Games conjecture
TheoremDB P44 · computational complexity
TheoremDB· Source catalogue assessment
OP-6835Algorithms and data structuresStatus unassessed
The Černý Conjecture on Synchronizing Words
TheoremDB P9580 · Candidate awaiting source review
TheoremDB· Source candidate · not reviewed
OP-6817Algorithms and data structuresStatus unassessed
The Strong Sensitivity Conjecture
TheoremDB P8658 · Candidate awaiting source review
TheoremDB· Source candidate · not reviewed
OP-6797Algorithms and data structuresStatus unassessed
The P versus NP Problem
TheoremDB P9964 · Candidate awaiting source review
TheoremDB· Source candidate · not reviewed
OP-6794Algorithms and data structuresStatus unassessed
The NP versus coNP Problem
TheoremDB P10000 · Candidate awaiting source review
TheoremDB· Source candidate · not reviewed
OP-6673Algorithms and data structuresOpen
Strong Exponential Time Hypothesis
TheoremDB P3140 · theoretical computer science
TheoremDB· Source catalogue assessment
OP-6638Algorithms and data structuresOpen
Smallest zero-suppressed decision diagram for spanning trees of K6
TheoremDB P3764 · algorithms
TheoremDB· Source catalogue assessment
OP-6637Computational complexitySolved
Smallest variable-order OBDD for the middle bit of six-bit multiplication
TheoremDB P2572 · decision diagrams
TheoremDB· Source catalogue assessment
OP-6631Algorithms and data structuresOpen
Smallest OBDD for directed reachability in a three by four grid
TheoremDB P3726 · algorithms
TheoremDB· Source catalogue assessment
OP-6613Algorithms and data structuresSolved
Shortest superstring of the binary Lyndon words of length eight
TheoremDB P2600 · formal languages
TheoremDB· Source catalogue assessment
OP-6571Algorithms and data structuresOpen
Reset threshold of the cyclic pair-compression automaton
TheoremDB P2560 · automata theory
TheoremDB· Source catalogue assessment
OP-6416Algorithms and data structuresOpen
Polynomial-time recovery of planted cliques below the square-root scale
TheoremDB P3130 · theoretical computer science
TheoremDB· Source catalogue assessment
OP-6414Computational complexityStatus unassessed
Polynomial-Factor Hardness for the Closest Vector Problem
TheoremDB P3568 · complexity theory
TheoremDB· Source catalogue assessment
OP-6405Algorithms and data structuresOpen
Polynomial determinization of two-way finite automata
TheoremDB P2832 · theoretical computer science
TheoremDB· Source catalogue assessment
OP-6371Computational complexityOpen
P versus NP
TheoremDB P39 · computational complexity
TheoremDB· Source catalogue assessment
OP-6254Computational complexitySolved
Multiplicative complexity of the six-bit threshold-at-least-three function
TheoremDB P2602 · circuit complexity
TheoremDB· Source catalogue assessment
OP-6249Computational complexityOpen
Most minimal unsatisfiable subformulas in a small 2-CNF
TheoremDB P3762 · sat
TheoremDB· Source catalogue assessment
OP-6229Algorithms and data structuresOpen
Minimum XOR circuit for an eight-tap cyclic transform
TheoremDB P3720 · algorithms
TheoremDB· Source catalogue assessment
OP-6227Algorithms and data structuresOpen
Minimum telephone-gossip time on the five by five torus
TheoremDB P3750 · distributed algorithms
TheoremDB· Source catalogue assessment
OP-6125Computational complexityStatus unassessed
Lower Bounds for Rational Formulas Computing the Permanent
TheoremDB P3564 · complexity theory
TheoremDB· Source catalogue assessment
OP-6085Algorithms and data structuresOpen
Longest shortest counterexample to universality for an eight-state binary NFA
TheoremDB P3730 · automata theory
TheoremDB· Source catalogue assessment
OP-6071Algorithms and data structuresOpen
Logarithmic DFA separation of binary words
TheoremDB P2834 · theoretical computer science
TheoremDB· Source catalogue assessment
OP-6019Computational complexitySolved
Leaf complexity of six-vertex graph connectivity
TheoremDB P2570 · decision tree complexity
TheoremDB· Source catalogue assessment
Frequent tags
theoremdb 3909historical workshop 3469aim 3469icm 2898source curated 2675source candidate 1231number theory 1007status unassessed 622specialist collection 522pde dyn 399geometry 336analysis 269algebraic geometry 257algebra 224verifiable 2026 223probability 221graph theory 200topology 199lie rep 180combinatorics 154combinatorics discrete mathematics 141mathematical physics mechanics 137numerical analysis computer science 131research 2026 126