Complexity of Problem

Complexity of Problem definition - hacker
A computing science term, complexity of problem refers to the degree of difficulty in solving a problem. Although algorithms for solving a problem may be written, they may force a computer to take a long period of time to solve it if complex.

See Also: Algorithm; Computer.

Webster's New World Hacker Dictionary Copyright © 2006 by Bernadette Schell and Clemens Martin.
Published by Wiley Publishing, Inc., Indianapolis, Indiana.
Used by arrangement with John Wiley & Sons, Inc.

Comments
Improve this definition.
Do you have more to add? Share your linguistic knowledge or observation.
/Register to save your comments.