Solving NP-Complete Problems?

In preparing for the interview with the Java-based Drools Planner on FLOSS Weekly, my attention was grabbed by the claim it can solve NP-complete problems. You’ll need to watch the show to see how that worked out!

Follow

Get every new post delivered to your Inbox.

Join 104 other followers

%d bloggers like this: