Relative Content

Tag Archive for np-complete

Who said “Twenty years ago, NP-complete meant it was impossible, now it means it’s easy?”

I don’t think that’s the exact quote, but it was something close to that. I read it maybe 10 years ago in either a blog or a book, and it was attributed to a specific computer scientist. The idea he was trying to explain was that SAT solvers are fast enough to solve most specific (and non-pathological) examples of NP-complete problems.

Problem proved NP-Complete. An algoritm solves in polnomial time. No NP-Complete?

We have a proven NP-Complete problem. With an algorithm we are solving great instances of this problem for a long time in polynomial time. This means that P=NP? the problem isnt NP-Complete?

Dynamic Programming Problem – To find smallest integer number ‘x’ which contains only digits 1’s and 0’s such that x mod n = 0

To design an algorithm that will output the smallest integer number ‘x’ which contains only digits 1’s and 0’s such that x mod n = 0 and x > 0…..
For example:

Dynamic Programming Problem – To find smallest integer number ‘x’ which contains only digits 1’s and 0’s such that x mod n = 0

To design an algorithm that will output the smallest integer number ‘x’ which contains only digits 1’s and 0’s such that x mod n = 0 and x > 0…..
For example:

Algorithm to find minimal set