Topic
complete.
notion of the "hardest" or "most general" problem in a complexity class
The journal
Open the journal →The conversation starts in the journal — be the first to post.
About complete
In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" problems in the complexity class.
Everything about complete →