NP-Completeness of a Combinator Optimization Problem

M. S. Joy, Victor J. Rayward-Smith. NP-Completeness of a Combinator Optimization Problem. Notre Dame Journal of Formal Logic, 36(2):319-335, 1995.

Abstract

Abstract is missing.