{"id":"https://openalex.org/W1963980186","doi":"https://doi.org/10.1137/0209031","title":"On the Computational Complexity of Program Scheme Equivalence","display_name":"On the Computational Complexity of Program Scheme Equivalence","publication_year":1980,"publication_date":"1980-05-01","ids":{"openalex":"https://openalex.org/W1963980186","doi":"https://doi.org/10.1137/0209031","mag":"1963980186"},"language":"en","primary_location":{"id":"doi:10.1137/0209031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209031","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086835651","display_name":"Harry B. Hunt","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"H. B. Hunt III","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103371465","display_name":"Robert L. Constable","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. L. Constable","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5070824596","display_name":"Sartaj Sahni","orcid":"https://orcid.org/0000-0002-8129-1676"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Sahni","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086835651"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7322,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.90110634,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"9","issue":"2","first_page":"396","last_page":"416"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994999766349792,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994999766349792,"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/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"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/decidability","display_name":"Decidability","score":0.8144491910934448},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7092262506484985},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7049599289894104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6081375479698181},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.500551700592041},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4494025409221649},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.44514980912208557},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4305557906627655},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4139895439147949},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24184873700141907}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8144491910934448},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7092262506484985},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7049599289894104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6081375479698181},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.500551700592041},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4494025409221649},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.44514980912208557},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4305557906627655},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4139895439147949},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24184873700141907},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0209031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209031","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W611290337","https://openalex.org/W1988826480","https://openalex.org/W2010927194","https://openalex.org/W2016313399","https://openalex.org/W2028140996","https://openalex.org/W2030681981","https://openalex.org/W2064204259","https://openalex.org/W2592184324"],"related_works":["https://openalex.org/W4234189135","https://openalex.org/W2617189160","https://openalex.org/W2170336571","https://openalex.org/W2990853482","https://openalex.org/W2327776271","https://openalex.org/W2374430960","https://openalex.org/W2041069649","https://openalex.org/W2047754121","https://openalex.org/W2461808546","https://openalex.org/W1589381382"],"abstract_inverted_index":{"The":[0,18,45,72],"computatiional":[1],"complexity":[2],"of":[3,79],"several":[4],"decidable":[5,93],"problems":[6,27],"about":[7],"program":[8,32,64,83],"schemes,":[9,11,84,88],"recursion":[10,38],"and":[12,25,34],"simple":[13],"programming":[14,52],"languages":[15],"is":[16,54,89],"considered.":[17],"strong":[19,73],"equivalence,":[20,22],"weak":[21],"containment,":[23],"halting,":[24],"divergence":[26],"for":[28,48,62,76],"the":[29,35,49,80,85],"single":[30,81],"variable":[31,82],"schemes":[33,39],"linear":[36],"monadic":[37],"are":[40,70],"shown":[41,56,90],"to":[42,57,67,91],"be":[43,58,68,92],"$NP$-complete.":[44,59],"equivalence":[46,74],"problem":[47,66,75],"Loop":[50],"1":[51],"language":[53],"also":[55],"Sufficient":[60],"conditions":[61],"a":[63,77],"scheme":[65],"$NP$-hard":[69],"presented.":[71],"subset":[78],"strongly":[86],"free":[87],"deterministically":[94],"in":[95],"polynomial":[96],"time.":[97]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}