Good enough is better than no solution at all, right? Most of the time, probably. You might be able to find an approximate solution to your problem. If your problem is intractable in this way, all is not lost. But if your input size ever grows, it's unlikely you'll be able to keep up. If you can out-purchase your problem in computing power, then problems in NP will surrender to you. Depending on the problem you're solving, that might just work. Sure, maybe you can grab a bunch of commodity servers and try to scale the heck out of your attempt. If the problem you wish to solve is not trivial, or if you will face many instances of the problem and expect some will not be trivial, then it's unlikely you'll be able to find the exact solution. The traveling salesman problem is easy to solve if you live in a country where all roads for a ring with exactly one road in and out. Sudoku is pretty easy if only 2 remaining squares need to be filled in. Perhaps you'll be lucky and discover that your particular instance of the problem is easy. If a problem you are trying to solve happens to be in NP, then you should consider the implications very carefully. Depending on your goals or the goals of your employer, there are many challenging problems you may attempt to solve. To me, the most reason to know about NP is a practical one. NP is an important concept for many reasons. This guess / provided input is often called a witness string. If they all ran in parallel, one of them could verify it's input in polynomial time. Given enough such machines, one of them will have the right answer. Imagine a machine with a random input already written in its memory. This notion of random guessing the solution is where the N in NP comes from: Non-deterministic. In fact, as far as anyone knows, in the general case of all possible examples of the game, it seems no strategy can do better on average than just random guessing. The effort of developing the solution to the Sudoku game seems to be intrinsically more difficult. If someone hands you a completed Sudoku puzzle, it's not difficult to see if they made any mistakes. Given a solution to a particular problem, if it can be verified/checked in polynomial time, that problem might be in NP. It will be discussed in more detail in a future episode. I say it "seems" this way because, while most people believe it to be true, it has not been proven. Brute force search cannot be done in polynomial time, so it seems that problems in NP are more difficult than problems in P. NP are algorithms which seem to require brute force. The class P contains all algorithms which run in polynomial time (basically, a nested for loop iterating over the input). That runtime is measured in the how many steps an algorithm takes relative to the input size. Algorithms with similar runtimes are said to be in the same complexity class.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |