Class Description

SE: Subexponentially-Solvable Search Problems

The class of FNP search problems solvable in O(2εn) time for every ε>0.

Defined in [IPZ01], who also gave reductions showing that if any of k-SAT, k-colorability, k-set cover, clique, or vertex cover is in SE, then all of them are.

Linked From

No class.