CITATION STYLE
Pudlák, P. (1975). Polynomially complete problems in the logic of automate discovery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 32 LNCS, pp. 358–361). Springer Verlag. https://doi.org/10.1007/3-540-07389-2_221
Mendeley helps you to discover research relevant for your work.