Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap

provably difficult

You are here: irt.org | FOLDOC | provably difficult

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

Nearby terms: prototype « Prototyper « prototyping « provably difficult » provably unsolvable » provider » provocative maintenance

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb