Instance complexity for sorting and NP-complete problems

Heikki Mannila: Instance complexity for sorting and NP-complete problems. PhD thesis, Report A-1985-1, Department of Computer Science, University of Helsinki, 1985. 81 pages. <http://www.cs.helsinki.fi/TR/A-1985/1>

Full paper:
Metadata: XML file

Abstract

Index Terms

Categories and Subject Descriptors:
F.2.2

General Terms:

Additional Key Words and Phrases: