provably difficult

Computing Dictionary

provably difficult definition

The set or property of problems for which it can be proven that no polynomial-time algorithm exists, only exponential-time algorithms.

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: provably
Next Definition: provably unsolvable
Words Near: provably difficult
More from
Synonyms and Antonyms for provably difficult
More from
Search for articles containing provably difficult Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature