Kybernetika 17 no. 5, 359-367, 1981

Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs