Checking identities is computationally intractable NP-hard and therefore human provers will always be needed.
Vladik KreinovichChin-Wang TaoPublished in: Int. J. Intell. Syst. (2004)
Keyphrases
- np hard
- scheduling problem
- approximation algorithms
- human subjects
- computational complexity
- lower bound
- video sequences
- greedy heuristic
- np complete
- theorem prover
- theorem proving
- computationally tractable
- np hardness
- human beings
- human interaction
- human users
- human motion
- knapsack problem
- closely related
- special case
- search space
- expert systems