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.

members

here now

Everything about complete →

Live room · 1 here

Be the first in the room — members see you arrive.

Join the room

Facts from Wikidata (CC0).

complete

notion of the "hardest" or "most general" problem in a complexity class

0members1here now

Ask Genius Site

Site Journal

Not who you're looking for? Others named complete: 2003 song performed by Jaimeson · The Veronicas album · album by Lila McCann · compilation album by The Smiths

Feed Discussions About

Comments

Ask Genius by OpenServe:

Free account · your comment posts right after signup

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.

members

here now

Everything about complete →

Live room · 1 here

Be the first in the room — members see you arrive.

Join the room

Facts from Wikidata (CC0).

Not who you're looking for? Others named complete: 2003 song performed by Jaimeson · The Veronicas album · album by Lila McCann · compilation album by The Smiths