Of course that guarantee is not particularly useful, because the program won't necessarily run on a real machine without running out of RAM.
At which point I point out my weasel words, "almost certainly not NP-complete" and say that my "almost certainly" was based on my strong suspicion that most concrete programming problems which would result in this kind of question coming up involve small integers. With the critical question being how small.
In reply to Re^2: NP-complete sometimes isn't
by tilly
in thread NP-complete sometimes isn't
by tilly
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |