ConceptMathematics
HyperClique conjecture
A complexity conjecture stating that for 3-uniform hypergraphs, no sub-optimal polynomial time algorithm faster than exists for finding -hypercliques.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.