Brute-force is apparently applicable to any problem of NP, since if you have some candidate for an answer, you can easily check / verify this candidate (but finding a candidate is still hard). For example: given a phone number to find its owner in the phone book, you can easily check it, but you need … Continue reading Grover’s Algorithm