Steklov Institute of Mathematics at St.Petersburg

PREPRINT 21/2006

AUTOMATED PROOFS OF UPPER BOUNDS FOR NP-HARD PROBLEMS: IMPLEMENTATION DETAILS

This preprint was accepted December 22, 2006

ABSTRACT:
Recently, several programs for automated analysis of the running time
of splitting algorithms were implemented. In this paper we provide
the details of implementation of the program presented by Fedin and Kulikov
and indicate several ways of its improvement.