Questions tagged [np]

NP stands for nondeterministic polynomial time. One characterization: the set of decision problems solved by a nondeterministic Turing machine in polynomial time.

Filter by
Sorted by
Tagged with
13
votes
3answers
2k views

Formula for dropping dice (non-brute force)

First of all I'm not sure where this question should be posted. I'm asking if a statistics problem is NP-Complete and if not to solve it programmatically. I'm posting it here because the statistics ...