NP-Completeness of Combinator Optimisation Problem

Research output: Contribution to journalArticle

Original languageEnglish
Pages (from-to)319-335
Number of pages17
JournalNotre Dame Journal of Formal Logic
Volume36
Issue number2
DOIs
Publication statusPublished - 1995

Cite this