Class Description

FP^NP[log]: FP With Logarithmically Many Queries To NP

Given a graph, the problem of outputting the size of its maximum clique is complete for FP^NP[log].

Linked From

No class.