3 ms·
If the NxNxN case is NP-complete, then that currently known optimal method will still require an N^k amount of steps.
by dtech 9y ago
If the NxNxN case is NP-complete, then that currently known optimal method will still require an N^k amount of steps.