| Original language | English |
|---|---|
| Pages (from-to) | 319-335 |
| Number of pages | 17 |
| Journal | Notre Dame Journal of Formal Logic |
| Volume | 36 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1995 |
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver
NP-Completeness of Combinator Optimisation Problem
- M. S. Joy
- , V. J. Rayward-Smith
Research output: Contribution to journal › Article