21. A search problem is represented as a relation consisting of all the instance-solution pairs, called a " search relation ". 22. A problem is complete for the class PPA if in addition, this graph search problem is reducible to that problem. 23. The problem can be interpreted as a search problem where the set of possible partial-order plans is the search space. 24. Awkwardly, it does not restrict the class NP-hard to decision problems, for instance it also includes search problems , or optimization problems. 25. By viewing the Web through its linkages and not merely by key words, Kleinberg's search algorithm solves another common search problem . 26. Further to Template talk : Hat # Search problem with hatting . talk 12 : 57, 26 May 2010 ( UTC) 27. The linear search problem was solved by Anatole Beck and Donald J . Newman ( 1970 ) as a two-person zero-sum game. 28. As scientists, their goal is not to help Tech win games, but to solve what they call a " classic visual-search problem ." 29. An optimization problem asks for finding a " best possible " solution among the set of all possible solutions to a search problem . 30. Consumer groups and career experts say they are expecting more job search problems to arise if the economy remains weak and unemployment climbs.
