OP-10043Computational complexityStatus unassessed
Polynomial-time computability of factoring
Polynomial-time computability of factoring
Formal Conjectures· Specialist source · status unassessed
The index
Explore the frontier
7 entries matching the current filters. Sorted by recently added.
OP-9980Computational complexityStatus unassessed
Černý Conjecture
Černý Conjecture
Formal Conjectures· Specialist source · status unassessed
OP-9955Computational complexityStatus unassessed
Strong Sensitivity Conjecture (`bs(f) ≤ s(f)^2`)
Strong Sensitivity Conjecture ( bs(f) ≤ s(f)^2 )
Formal Conjectures· Specialist source · status unassessed
OP-9762Computational complexityStatus unassessed
Conjectures in Complexity Theory
Conjectures in Complexity Theory
Formal Conjectures· Specialist source · status unassessed
OP-9469Computational complexityStatus unassessed
PH versus PSPACE
Does the polynomial hierarchy equal the class of languages decidable using polynomial space?
Wikipedia — Computer science· Wikipedia selection · status unassessed
OP-9468Computational complexityStatus unassessed
L versus NL
Can every language decidable in nondeterministic logarithmic space also be decided in deterministic logarithmic space?
Wikipedia — Computer science· Wikipedia selection · status unassessed
OP-9467Computational complexityStatus unassessed
NC versus P
Does every problem decidable in polynomial time admit a uniform family of polynomial-size Boolean circuits of polylogarithmic depth?
Wikipedia — Computer science· Wikipedia selection · status unassessed
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