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.
@article{JoyR95,
title = {NP-Completeness of a Combinator Optimization Problem},
author = {M. S. Joy and Victor J. Rayward-Smith},
year = {1995},
tags = {optimization, completeness},
researchr = {https://researchr.org/publication/JoyR95},
cites = {0},
citedby = {0},
journal = {Notre Dame Journal of Formal Logic},
volume = {36},
number = {2},
pages = {319-335},
}