For questions about algorithms for so-called 'NP complete' problems, which are among the hardest computational problems to solve.
Questions tagged [np-complete]
10 questions
-4
votes
1 answer
How to determine computational infeasibility of NP Complete
For an NP complete problem, how is computational infeasibility determined?
Are there guidelines that that determine whether an NP Complete problem is computationally infeasible?
user389823
- 95
- 3