Complete (complexity)¶

In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class.

Version: v1 · 2026-09-28 · History
Domain-specific #: 8594
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomain: Computational Complexity Theory → Computer Science & Software Engineering

Core Idea¶

Complete (complexity) is treated here as the recurring computing and information systems identity summarized by this source-grounded definition: In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class.

In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class. More formally, a problem p is called hard for a complexity class C under a given type of reduction if there exists a reduction (of the given type) from any problem in C to p. If a problem is both hard for the class and a member of the class, it is complete for that class (for that type of reduction).

A problem that is complete for a class C is said to be C-complete, and the class of all problems complete for C is denoted C-complete. The first complete class to be defined and the most well known is NP-complete, a class that contains many difficult-to-solve problems that arise in practice. Similarly, a problem hard for a class C is called C-hard, e.g.

For Complete (complexity), the abstraction is narrower than the article's general subject matter: a positive case must preserve In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in computing and information systems, which is why this identity is domain-specific rather than prime.

How would you explain it like I'm…

The Master Puzzle

Imagine a big box of puzzles, and one special puzzle in the box has a trick: every other puzzle in the box can be changed into it. So if you could solve that special one, you could solve them all. That special puzzle is called complete for that box.

Hardest Problem in the Group

Computer scientists sort problems into groups, called complexity classes, depending on how much work they take to solve. A problem is complete for a group if it is in the group and every other problem in the group can be changed into it, using an allowed kind of changing trick called a reduction. That means if you had a fast way to solve the complete problem, you could use it to solve all the others too. So the complete problems are, in a special sense, the hardest ones in the group. The most famous example is the NP-complete problems, which include many hard problems people face in real life.

Complete for a Complexity Class

In computational complexity theory, a complexity class is a set of problems that can be solved within some resource limit. A problem p is hard for a class C if every problem in C can be reduced to p — converted into an instance of p — using a specified type of reduction. If p is both hard for C and itself a member of C, it is complete for C, or 'C-complete'. Being complete makes p among the 'hardest' or 'most expressive' problems in C, in a technical sense: solving p lets you solve anything in C through the reduction. It doesn't just mean the problem takes a long time — it's about every problem in the class translating into it. NP-complete was the first such class defined and is the best known; a problem that is hard for C but not necessarily in C is called C-hard.

Completeness in complexity theory formalizes the idea of a hardest, or most expressive, problem in a complexity class. It is defined relative to a type of reduction, a transformation that maps instances of one problem to instances of another. A problem p is hard for class C (C-hard) under a given reduction type if every problem in C reduces to p by that type of reduction. If p is C-hard and also belongs to C, it is C-complete, and the set of all such problems is itself denoted C-complete. The reduction type matters: completeness is always completeness for a class under a specified kind of reduction. NP-complete was the first complete class defined and is the best known, containing many hard problems arising in practice.

Structural Signature¶

Sig role-phrases:

Defining carrier — In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class.
Constitutive relation — More formally, a problem p is called hard for a complexity class C under a given type of reduction if there exists a reduction (of the given type) from any problem in C to p.
Operating condition — If a problem is both hard for the class and a member of the class, it is complete for that class (for that type of reduction).
Recognition evidence — A problem that is complete for a class C is said to be C-complete, and the class of all problems complete for C is denoted C-complete.
Admissible variation — The first complete class to be defined and the most well known is NP-complete, a class that contains many difficult-to-solve problems that arise in practice.
Characteristic consequence — Similarly, a problem hard for a class C is called C-hard, e.g.
Failure boundary — Normally, it is assumed that the reduction in question does not have higher computational complexity than the class itself.

What It Is Not¶

Not the whole field of computing and information systems. The node requires the specific identity stated by In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class.
Not an over-broad reading. Normally, it is assumed that the reduction in question does not have higher computational complexity than the class itself.
Not an over-broad reading. Generally, complexity classes that have a computable enumeration have known complete problems, whereas classes that lack a computable enumeration have none.
Not an over-broad reading. In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class.
Not automatically Computational complexity theory. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Complete (complexity) applies literally inside computing and information systems wherever the source-defined carrier and relation can be established. Its documented habitats include:

Documented setting. The first complete class to be defined and the most well known is NP-complete, a class that contains many difficult-to-solve problems that arise in practice.
Documented setting. In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class.
Documented setting. More formally, a problem p is called hard for a complexity class C under a given type of reduction if there exists a reduction (of the given type) from any problem in C to p.
Documented setting. If a problem is both hard for the class and a member of the class, it is complete for that class (for that type of reduction).
Documented setting. A problem that is complete for a class C is said to be C-complete, and the class of all problems complete for C is denoted C-complete.
Documented setting. Similarly, a problem hard for a class C is called C-hard, e.g.

Outside computing and information systems, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Classification or should be marked as analogy.

Clarity¶

A clear use of Complete (complexity) names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class. The strongest recognition evidence in the frozen account is: A problem that is complete for a class C is said to be C-complete, and the class of all problems complete for C is denoted C-complete. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification Normally, it is assumed that the reduction in question does not have higher computational complexity than the class itself. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Complete (complexity) compresses multiple computing and information systems details into a stable diagnostic relation. The source shows both the central mechanism—more formally, a problem p is called hard for a complexity class C under a given type of reduction if there exists a reduction (of the given type) from any problem in C to p.—and the practical consequence—similarly, a problem hard for a class C is called C-hard, e.g. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the computing and information systems entities to which the claim applies.
State the relation. Use the source-grounded identity: In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class.
Check operation and conditions. If a problem is both hard for the class and a member of the class, it is complete for that class (for that type of reduction).
Demand recognition evidence. A problem that is complete for a class C is said to be C-complete, and the class of all problems complete for C is denoted C-complete.
Test variation. Change an implementation or setting while preserving the first complete class to be defined and the most well known is NP-complete, a class that contains many difficult-to-solve problems that arise in practice.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Classification.

Knowledge Transfer¶

Within the home domain. Knowledge about Complete (complexity) transfers literally when a new case preserves the same carrier type, relation, and recognition test. The first complete class to be defined and the most well known is NP-complete, a class that contains many difficult-to-solve problems that arise in practice. In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class.

Beyond the home domain. No canonical parent is asserted for Complete (complexity). An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

Similarly, a problem hard for a class C is called C-hard, e.g. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class; recognition evidence → A problem that is complete for a class C is said to be C-complete, and the class of all problems complete for C is denoted C-complete

Applied / In Practice¶

For example, NP, co-NP, PLS, PPA all have known natural complete problems. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → the applied context; invariant → In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class; boundary → the case exits the class when normally, it is assumed that the reduction in question does not have higher computational complexity than the class itself

Structural Tensions¶

T1 — Stable identity versus admissible variation. Normally, it is assumed that the reduction in question does not have higher computational complexity than the class itself. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. Generally, complexity classes that have a computable enumeration have known complete problems, whereas classes that lack a computable enumeration have none. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. More formally, a problem p is called hard for a complexity class C under a given type of reduction if there exists a reduction (of the given type) from any problem in C to p. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Complete (complexity) literally, co-instantiate Classification, or only resemble it?

T6 — Autonomy versus reduction. More formally, a problem p is called hard for a complexity class C under a given type of reduction if there exists a reduction (of the given type) from any problem in C to p. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Complete (complexity) distinguish that the broader parent Classification leaves together?

Structural–Framed Character¶

Complete (complexity) is mixed or framed-leaning. Its structural side is the repeatable organization summarized by In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class. Its framed side is the computing and information systems vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: If a problem is both hard for the class and a member of the class, it is complete for that class (for that type of reduction). Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Classification. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class. More formally, a problem p is called hard for a complexity class C under a given type of reduction if there exists a reduction (of the given type) from any problem in C to p. It further constrains recognition and variation through: If a problem is both hard for the class and a member of the class, it is complete for that class (for that type of reduction). A problem that is complete for a class C is said to be C-complete, and the class of all problems complete for C is denoted C-complete.

What is domain-bound. computing and information systems supplies the operative entities, technical vocabulary, warrants, and exceptions that make Complete (complexity) literal. Its documented scope includes the condition that The first complete class to be defined and the most well known is NP-complete, a class that contains many difficult-to-solve problems that arise in practice. Another bounded application condition is that In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—The first complete class to be defined and the most well known is NP-complete, a class that contains many difficult-to-solve problems that arise in practice.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry presupposes Complexity Class.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Complete (complexity). The reviewed identity is: In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Complete (complexity) Domain-specific

Parents (1) — more general patterns this builds on

Complete (complexity) presupposes Complexity Class Domain-specific

Completeness is defined relative to membership in a complexity class and reductions from every class member.

Neighborhood in Abstraction Space¶

Complete (complexity) sits in a moderately populated region (58^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Computation Models & Complexity Classes (37 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Classification. The parent omits the specialist differentia. Tell: Can the case establish In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class?
Computational complexity theory. The theory classifying computational problems by resource requirements and reductions under explicit models of computation. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Boolean hierarchy. The hierarchy of complexity classes obtained from finite Boolean combinations of NP languages. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Reduction (complexity). An algorithmic transformation from instances of one computational problem to another that preserves answers and is efficient enough to transfer solvability or hardness results. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Complete (complexity) remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside computing and information systems lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Classification?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Complete_(complexity) (revision 1325213058).

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.