Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
@article{KYB_1981__17_5_a1, author = {Kramosil, Ivan}, title = {Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs}, journal = {Kybernetika}, pages = {359--367}, publisher = {mathdoc}, volume = {17}, number = {5}, year = {1981}, mrnumber = {648208}, zbl = {0484.68073}, language = {en}, url = {http://geodesic.mathdoc.fr/item/KYB_1981__17_5_a1/} }
TY - JOUR AU - Kramosil, Ivan TI - Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs JO - Kybernetika PY - 1981 SP - 359 EP - 367 VL - 17 IS - 5 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/KYB_1981__17_5_a1/ LA - en ID - KYB_1981__17_5_a1 ER -
%0 Journal Article %A Kramosil, Ivan %T Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs %J Kybernetika %D 1981 %P 359-367 %V 17 %N 5 %I mathdoc %U http://geodesic.mathdoc.fr/item/KYB_1981__17_5_a1/ %G en %F KYB_1981__17_5_a1
Kramosil, Ivan. Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs. Kybernetika, Tome 17 (1981) no. 5, pp. 359-367. http://geodesic.mathdoc.fr/item/KYB_1981__17_5_a1/