NP-completeness of combinatorial problems with unary notation for integers

Martti Penttonen. NP-completeness of combinatorial problems with unary notation for integers. Fundamenta Informaticae, 3(3):397, 1980.

Abstract

Abstract is missing.