______ problems are difficult for computers to solve.\np\ntractable\nnp\nnp - hard
______ problems are difficult for computers to solve.\np\ntractable\nnp\nnp - hard
Answer
Brief Explanations:
P problems can be solved in polynomial - time by a deterministic Turing machine. Tractable problems are those that can be solved efficiently. NP problems can be verified in polynomial - time. NP - hard problems are at least as hard as the hardest problems in NP, and are difficult for computers to solve as there is no known efficient algorithm for them.
Answer:
NP - hard