Computer science
The 17 problems with a statement whose AMS attribute names 68, Computer science, in the Mathematics Subject Classification. A problem with statements in several subjects is listed under each; its article sits in its source folder's part.
- Erdős Problem 78
- Density of ones in the Kolakoski sequence
- Subword complexity of the morphism a → aab, b → b
- Černý Conjecture
- Babai–Seress Conjectures on the Diameter of Finite Groups
- Polynomial-time computability of factoring
- Scholz conjecture on addition chains
- Polynomial-time computability of comparisons of sums of square roots
- Decidability of reachability for branching vector addition systems
- Complete disjoint NP pairs
- Pudlák's conjectures on incompleteness in the finite domain
- Strong Sensitivity Conjecture (`bs(f) ≤ s(f)^2`)
- Bugeaud Collection of Conjectures and Open Questions: Automatic Expansions in Two Bases
- Beaver Math Olympiad (BMO)
- The Rule 30 Prize Problems
- Conjectures in Complexity Theory
- Tao's Optimization Constant 14 / Smallest \(n\) for which the value of \(BB(n)\) is undecidable
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.