{"id":"https://openalex.org/W1976534954","doi":"https://doi.org/10.1016/0304-3975(93)90109-7","title":"Methods for proving completeness via logical reductions","display_name":"Methods for proving completeness via logical reductions","publication_year":1993,"publication_date":"1993-09-01","ids":{"openalex":"https://openalex.org/W1976534954","doi":"https://doi.org/10.1016/0304-3975(93)90109-7","mag":"1976534954"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(93)90109-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(93)90109-7","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5061350983","display_name":"Iain A. Stewart","orcid":"https://orcid.org/0000-0002-0752-1971"},"institutions":[{"id":"https://openalex.org/I84884186","display_name":"Newcastle University","ror":"https://ror.org/01kj2bm70","country_code":"GB","type":"education","lineage":["https://openalex.org/I84884186"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Iain Stewart A.","raw_affiliation_strings":["Computing Laboratory, University of Newcastle upon Tyne, Claremont Tower, Claremont Road, Newcastle upon Tyne NE1 7RU, UK","Computing Laboratory, University of Newcastle-Upon-Tyne, Claremont Tower, Claremont Road, Newcastle-Upon-Tyne NE1 7RU, UK"],"affiliations":[{"raw_affiliation_string":"Computing Laboratory, University of Newcastle upon Tyne, Claremont Tower, Claremont Road, Newcastle upon Tyne NE1 7RU, UK","institution_ids":["https://openalex.org/I84884186"]},{"raw_affiliation_string":"Computing Laboratory, University of Newcastle-Upon-Tyne, Claremont Tower, Claremont Road, Newcastle-Upon-Tyne NE1 7RU, UK","institution_ids":["https://openalex.org/I84884186"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061350983"],"corresponding_institution_ids":["https://openalex.org/I84884186"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.0461,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.74240707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"118","issue":"2","first_page":"193","last_page":"229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9951000213623047,"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/T10142","display_name":"Formal Methods in Verification","score":0.9951000213623047,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.991100013256073,"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/completeness","display_name":"Completeness (order theory)","score":0.6881403923034668},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6646044850349426},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5462831854820251},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.534226655960083},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.48516303300857544},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4330804944038391},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42560523748397827},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3898232579231262},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3726218044757843},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3622997999191284},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3495585322380066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31039097905158997},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1640443503856659},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16290411353111267}],"concepts":[{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6881403923034668},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6646044850349426},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5462831854820251},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.534226655960083},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.48516303300857544},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4330804944038391},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42560523748397827},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3898232579231262},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3726218044757843},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3622997999191284},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3495585322380066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31039097905158997},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1640443503856659},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16290411353111267},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"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.1016/0304-3975(93)90109-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(93)90109-7","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W47988892","https://openalex.org/W163311453","https://openalex.org/W1495098865","https://openalex.org/W1553301919","https://openalex.org/W1585351758","https://openalex.org/W1801334096","https://openalex.org/W1812706522","https://openalex.org/W1970629906","https://openalex.org/W1976699171","https://openalex.org/W1986804393","https://openalex.org/W1989887898","https://openalex.org/W1990106480","https://openalex.org/W2007569718","https://openalex.org/W2008254124","https://openalex.org/W2011039300","https://openalex.org/W2017205387","https://openalex.org/W2017996596","https://openalex.org/W2039302045","https://openalex.org/W2043360684","https://openalex.org/W2045583484","https://openalex.org/W2048532387","https://openalex.org/W2053534720","https://openalex.org/W2058277150","https://openalex.org/W2059657394","https://openalex.org/W2065251436","https://openalex.org/W2065546707","https://openalex.org/W2089857781","https://openalex.org/W2121714568","https://openalex.org/W2136273331","https://openalex.org/W2136500328","https://openalex.org/W2317459460","https://openalex.org/W2480811457","https://openalex.org/W3127113455","https://openalex.org/W4245713184","https://openalex.org/W6601982429","https://openalex.org/W6635114662","https://openalex.org/W6638371292","https://openalex.org/W6647857335","https://openalex.org/W6652441464","https://openalex.org/W6680262191","https://openalex.org/W6721193952","https://openalex.org/W6789738865"],"related_works":["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/W2045590835","https://openalex.org/W1589381382","https://openalex.org/W2953001340","https://openalex.org/W342214647"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}