{"id":"https://openalex.org/W2739273244","doi":"https://doi.org/10.1007/s00037-017-0157-z","title":"Autoreducibility of NP-Complete Sets under Strong Hypotheses","display_name":"Autoreducibility of NP-Complete Sets under Strong Hypotheses","publication_year":2017,"publication_date":"2017-07-18","ids":{"openalex":"https://openalex.org/W2739273244","doi":"https://doi.org/10.1007/s00037-017-0157-z","mag":"2739273244"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-017-0157-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-017-0157-z","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","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/A5077270481","display_name":"John M. Hitchcock","orcid":"https://orcid.org/0000-0002-8614-7307"},"institutions":[{"id":"https://openalex.org/I12834331","display_name":"University of Wyoming","ror":"https://ror.org/01485tq96","country_code":"US","type":"education","lineage":["https://openalex.org/I12834331"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John M. Hitchcock","raw_affiliation_strings":["Department of Computer Science, University of Wyoming, Laramie, WY, USA","Department of Computer Science, University of Wyoming, Laramie, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wyoming, Laramie, WY, USA","institution_ids":["https://openalex.org/I12834331"]},{"raw_affiliation_string":"Department of Computer Science, University of Wyoming, Laramie, USA","institution_ids":["https://openalex.org/I12834331"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026789376","display_name":"Hadi Shafei","orcid":null},"institutions":[{"id":"https://openalex.org/I12834331","display_name":"University of Wyoming","ror":"https://ror.org/01485tq96","country_code":"US","type":"education","lineage":["https://openalex.org/I12834331"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hadi Shafei","raw_affiliation_strings":["Department of Computer Science, University of Wyoming, Laramie, WY, USA","Department of Computer Science, University of Wyoming, Laramie, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wyoming, Laramie, WY, USA","institution_ids":["https://openalex.org/I12834331"]},{"raw_affiliation_string":"Department of Computer Science, University of Wyoming, Laramie, USA","institution_ids":["https://openalex.org/I12834331"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077270481"],"corresponding_institution_ids":["https://openalex.org/I12834331"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13050291,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":"1","first_page":"63","last_page":"97"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T10237","display_name":"Cryptography and Data Security","score":0.9958999752998352,"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/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5206743478775024},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4930853545665741},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4677080512046814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3747636675834656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35862699151039124},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2656131088733673}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5206743478775024},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4930853545665741},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4677080512046814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3747636675834656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35862699151039124},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2656131088733673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00037-017-0157-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-017-0157-z","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322957","display_name":"Westf\u00e4lische Wilhelms-Universit\u00e4t M\u00fcnster","ror":"https://ror.org/00pd74e08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1490686376","https://openalex.org/W1964450092","https://openalex.org/W1975715978","https://openalex.org/W1986203294","https://openalex.org/W2004243323","https://openalex.org/W2028946424","https://openalex.org/W2030692444","https://openalex.org/W2080139332","https://openalex.org/W2101632555","https://openalex.org/W2137788273","https://openalex.org/W2144718727","https://openalex.org/W2169625092","https://openalex.org/W2180548934","https://openalex.org/W2258051301"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}