AUTOMATED PROOFS OF UPPER BOUNDS FOR NP-HARD PROBLEMS: IMPLEMENTATION DETAILS 1
Alexander S. Kulikov · 2006
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.