The limits of parallelism (job-interview question)

Posted by psihodelia on Stack Overflow See other posts from Stack Overflow or by psihodelia
Published on 2010-03-29T16:37:11Z Indexed on 2010/03/29 17:03 UTC
Read the original article Hit count: 588

Is it possible to solve a problem of O(n!) complexity within a reasonable time given infinite number of processing units and infinite space?

The typical example of O(n!) problem is brute-force search: trying all permutations (ordered combinations).

© Stack Overflow or respective owner

Related posts about big-o

Related posts about theory