Polynomially complete problems in the logic of automate discovery

1. Cook, S.A., The Complexity of Theorem-proving Procedures, Proc. Third Annual ACM Symposium on Theory of Computing, May, 1971, p. 151–158.

   Google Scholar 

2. Hájek, P., On Logics of Discovery, this volume pp. 30–45.

   Google Scholar 

3. Hájek, P., Automatic Listing of Important Observational Statements I, II, III, Kybernetika 9 (1973), 187–205, 251–270 and 10(1974), 95–124.

   Google Scholar 

4. Hájek, P., Havel, I. and Chytil, M., The GUHA Method of Automated Hypotheses Determination, Computing 1 (1966), 293–308.

   Google Scholar 

5. Hájek, P. and Havránek, T., A Logic of Automated Discovery, book in preparation.

   Google Scholar 

6. Karp, R. M., Reducibility among Combinatorial Problems, Complexity of Computer Computations, Plenum Press, NY 1972, 85–104.

   Google Scholar 

Download references