NP-complete problems: Tetris, Knapsack problem, Travelling salesman problem, Boolean satisfiability problem, Crossword, SameGame
Source: Source: Wikipedia,Paperback, English-language edition,Pub by General Books LLC NP-complete problems: Tetris, Knapsack problem, Travelling salesman problem, Boolean satisfiability problem, Crossword, SameGameReviews are not available for this product. |