RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI

Zap. Nauchn. Sem. LOMI, 1975, Volume 49, Pages 123–130 (Mi znsl2795)

Finite approach to the problem of optimization of theorem-proving algorithms
A. O. Slisenko

This publication is cited in the following articles:
  1. A. O. Slisenko, “Complexity problems in computational theory”, Russian Math. Surveys, 36:6 (1981), 23–125  mathnet  crossref  mathscinet  zmath  adsnasa  isi


© Steklov Math. Inst. of RAS, 2026