ConceptTheory & Algos
Sigma-i time complexity class
The class of languages decided within a given time bound by an alternating Turing machine of a specific Sigma type.
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.
Alternating Turing machine1Time complexity bounds1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.