## COMPLETE

### 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.

*The above text is a snippet from Wikipedia: Complete (complexity)*

and as such is available under the Creative Commons Attribution/Share-Alike License.

and as such is available under the Creative Commons Attribution/Share-Alike License.

### complete

#### Verb

- To finish; to make done; to reach the end.
*He***completed**the assignment on time.

- To make whole or entire.
*The last chapter***completes**the book nicely.

#### Adjective

- With all parts included; with nothing missing; full.
- Finished; ended; concluded; completed.
- in which every Cauchy sequence converges.
- in which every set with a lower bound has a greatest lower bound.
- in which all small limits exist.
- With respect to a given semantics, that any well-formed formula which is (semantically) valid must also be provable.

*The above text is a snippet from Wiktionary: complete*

and as such is available under the Creative Commons Attribution/Share-Alike License.

and as such is available under the Creative Commons Attribution/Share-Alike License.