论文信息 - Polynomially Complete Problems in the Logic of Automated Discovery - 字舞流文

Polynomially Complete Problems in the Logic of Automated Discovery

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[2] Petr Hájek,et al. Automatic listing of important observational statements. II , 1973, Kybernetika.

[3] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

[4] Petr Hájek. On Logics of Discovery , 1975, MFCS.