Exponential Time Complexity

This problem is among the class of notoriously difficult problems that are called NP-complete and that are believed to be intractable.

NP = "Nondeterministic Polynomial"

[Prev][TOC][Next]


CS1104 Main Page
Last Updated 01/05/2000
© L.Heath, 2000