Worlds of David Darling
Encyclopedia of Science
   
Home > Encyclopedia of Science

NP-hard problem




A mathematical problem for which, even in theory, no shortcut or smart algorithm is possible that would lead to a simple or rapid solution. Instead, the only way to find an optimal solution is a computationally-intensive, exhaustive analysis in which all possible outcomes are tested. Examples of NP-hard problems include the traveling salesman problem and the popular game Tetris.


Related category

   • COMPUTERS, ARTIFICIAL INTELLIGENCE, AND CYBERNETICS