{"id":"https://openalex.org/W2091336525","doi":"https://doi.org/10.1305/ndjfl/1040248462","title":"NP-Completeness of a Combinator Optimization Problem","display_name":"NP-Completeness of a Combinator Optimization Problem","publication_year":1995,"publication_date":"1995-04-01","ids":{"openalex":"https://openalex.org/W2091336525","doi":"https://doi.org/10.1305/ndjfl/1040248462","mag":"2091336525"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1040248462","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040248462","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-2/NP-Completeness-of-a-Combinator-Optimization-Problem/10.1305/ndjfl/1040248462.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-2/NP-Completeness-of-a-Combinator-Optimization-Problem/10.1305/ndjfl/1040248462.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012585972","display_name":"Mike Joy","orcid":"https://orcid.org/0000-0001-9826-5928"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. S. Joy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5003354242","display_name":"V. J. Rayward\u2010Smith","orcid":"https://orcid.org/0000-0003-2432-853X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"V. J. Rayward-Smith","raw_affiliation_strings":["School of Computing Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing Sciences","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012585972"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22130518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatory-logic","display_name":"Combinatory logic","score":0.9820879101753235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6544523239135742},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.6453495621681213},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5623121857643127},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5451745390892029},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.476817786693573},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.4684975743293762},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.43900009989738464},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4178047180175781},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.338242769241333},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3214864134788513},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26478031277656555},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1760583519935608},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12296989560127258}],"concepts":[{"id":"https://openalex.org/C79678938","wikidata":"https://www.wikidata.org/wiki/Q1481571","display_name":"Combinatory logic","level":2,"score":0.9820879101753235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6544523239135742},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.6453495621681213},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5623121857643127},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5451745390892029},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.476817786693573},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.4684975743293762},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.43900009989738464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4178047180175781},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.338242769241333},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3214864134788513},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26478031277656555},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1760583519935608},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12296989560127258},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1305/ndjfl/1040248462","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040248462","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-2/NP-Completeness-of-a-Combinator-Optimization-Problem/10.1305/ndjfl/1040248462.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:60784","is_oa":true,"landing_page_url":null,"pdf_url":"http://wrap.warwick.ac.uk/60784/1/WRAP_cs-rr-88.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1040248462","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1040248462","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:ueaeprints.uea.ac.uk:3009","is_oa":false,"landing_page_url":"https://ueaeprints.uea.ac.uk/id/eprint/3009/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400384","display_name":"UEA Digital Repository (University of East Anglia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1118541","host_organization_name":"University of East Anglia","host_organization_lineage":["https://openalex.org/I1118541"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"}],"best_oa_location":{"id":"doi:10.1305/ndjfl/1040248462","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040248462","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-2/NP-Completeness-of-a-Combinator-Optimization-Problem/10.1305/ndjfl/1040248462.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2091336525.pdf","grobid_xml":"https://content.openalex.org/works/W2091336525.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W157835511","https://openalex.org/W1574027841","https://openalex.org/W2011039300","https://openalex.org/W2044224215","https://openalex.org/W2045304669","https://openalex.org/W2063068243","https://openalex.org/W2074769340","https://openalex.org/W2077778948","https://openalex.org/W2154273644","https://openalex.org/W6669309895"],"related_works":["https://openalex.org/W2362240646","https://openalex.org/W2347992748","https://openalex.org/W2362689974","https://openalex.org/W1552914076","https://openalex.org/W2382586048","https://openalex.org/W4248117800","https://openalex.org/W2391201265","https://openalex.org/W2383356281","https://openalex.org/W2359365634","https://openalex.org/W2392581368"],"abstract_inverted_index":{"We":[0],"consider":[1],"a":[2,24,43,115],"deterministic":[3],"rewrite":[4],"system":[5],"for":[6,114],"combinatory":[7,70,74],"logic":[8,75],"over":[9,100],"combinators":[10],"$S,K,I,B,C,S',B'$,":[11],"and":[12,72],"$C'$.":[13],"Terms":[14],"will":[15,26],"be":[16,32,63,121],"represented":[17,64],"by":[18,65,123],"graphs":[19],"so":[20],"that":[21],"reduction":[22,50,98,124],"of":[23,49,93,97,107],"duplicator":[25],"cause":[27],"the":[28,47,55,83,95,105,109,126],"duplicated":[29],"expression":[30,56],"to":[31,53,57,87,120],"\"shared\"":[33],"rather":[34],"than":[35],"copied.":[36],"To":[37],"each":[38],"normalizing":[39],"term":[40],"we":[41],"assign":[42],"weighting":[44],"which":[45],"is":[46,118],"number":[48,96],"steps":[51,99],"necessary":[52],"reduce":[54],"normal":[58],"form.":[59],"A":[60],"lambda-expression":[61,85],"may":[62],"several":[66],"distinct":[67],"expressions":[68,76,103],"in":[69],"logic,":[71],"two":[73],"are":[77],"considered":[78],"equivalent":[79,101],"if":[80],"they":[81],"represent":[82],"same":[84],"(up":[86],"$\\beta":[88],"$-$\\eta":[89],"$-equivalence).":[90],"The":[91],"problem":[92,106],"minimizing":[94],"combinator":[102,112],"(i.e.,":[104],"finding":[108],"\"fastest":[110],"running\"":[111],"representation":[113],"specific":[116],"lambda-expression)":[117],"proved":[119],"NP-complete":[122],"from":[125],"\"Hitting":[127],"Set\"":[128],"problem.":[129]},"counts_by_year":[],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2016-06-24T00:00:00"}