Compute-aided proofs of theorems in scheduling:
Compute-aided proofs of
theorems in scheduling:
A method of proving theorems with an aid of computer was developed jointly with Ilya Tchernykh. The reader interested in details can find them in the paper "Computer-aided way to prove theorems in scheduling" by S.Sevastianov and I.Tchernykh accepted for publication in Lecture Notes in Computer Science, - in Proceedings of the fifth European Symposium on Algorithms'98 (ESA'98). The Post-script file of a Preliminary version of the paper and the PASCAL-codes of the computer programs used for proofs of theorems are available via Internet.
