Vladik Kreinovich, Chin-Wang Tao. Checking identities is computationally intractable NP-hard and therefore human provers will always be needed. Int. J. Intell. Syst., 19(1-2):39-49, 2004. [doi]
@article{KreinovichT04,
title = {Checking identities is computationally intractable NP-hard and therefore human provers will always be needed},
author = {Vladik Kreinovich and Chin-Wang Tao},
year = {2004},
doi = {10.1002/int.10149},
url = {http://dx.doi.org/10.1002/int.10149},
researchr = {https://researchr.org/publication/KreinovichT04},
cites = {0},
citedby = {0},
journal = {Int. J. Intell. Syst.},
volume = {19},
number = {1-2},
pages = {39-49},
}