mXSCNT
- 310
- 1
D H said:That an N statement perniciously written pile of spaghetti might expand to N! statements of neatly written structured program should not be too surprising. This rewriting of the code is essentially the general Boolean satisfiability problem, which is of course an NP-complete problem.
You are not making any sense to me. How about you make things a bit more formal?