{"id":"https://openalex.org/W1561713832","doi":"https://doi.org/10.1007/11786986_41","title":"Comparing Reductions to NP-Complete Sets","display_name":"Comparing Reductions to NP-Complete Sets","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1561713832","doi":"https://doi.org/10.1007/11786986_41","mag":"1561713832"},"language":"en","primary_location":{"id":"doi:10.1007/11786986_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11786986_41","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"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, USA","Department of Computer Science, University of Wyoming, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wyoming, USA","institution_ids":["https://openalex.org/I12834331"]},{"raw_affiliation_string":"Department of Computer Science, University of Wyoming, USA#TAB#","institution_ids":["https://openalex.org/I12834331"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112023986","display_name":"A. Pavan","orcid":"https://orcid.org/0000-0003-1665-5266"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Pavan","raw_affiliation_strings":["Department of Computer Science, Iowa State University, USA","Department of Computer Science, Iowa State University, USA;"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Iowa State University, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Department of Computer Science, Iowa State University, USA;","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077270481"],"corresponding_institution_ids":["https://openalex.org/I12834331"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06092709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"205","issue":"5","first_page":"465","last_page":"476"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9987999796867371,"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.9987999796867371,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9930999875068665,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8170129656791687},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.6624133586883545},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6084330081939697},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.6033271551132202},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.5956237316131592},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5705673694610596},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5668190717697144},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.5646733641624451},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5470252633094788},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4945831000804901},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4942922592163086},{"id":"https://openalex.org/keywords/p-versus-np-problem","display_name":"P versus NP problem","score":0.4649933874607086},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46271511912345886},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45399293303489685},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4397847056388855},{"id":"https://openalex.org/keywords/truth-table","display_name":"Truth table","score":0.42672306299209595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3115772008895874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2686276435852051},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.11191004514694214},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.09573554992675781}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8170129656791687},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.6624133586883545},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6084330081939697},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.6033271551132202},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.5956237316131592},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5705673694610596},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5668190717697144},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.5646733641624451},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5470252633094788},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4945831000804901},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4942922592163086},{"id":"https://openalex.org/C186861659","wikidata":"https://www.wikidata.org/wiki/Q746242","display_name":"P versus NP problem","level":3,"score":0.4649933874607086},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46271511912345886},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45399293303489685},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4397847056388855},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.42672306299209595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3115772008895874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2686276435852051},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.11191004514694214},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.09573554992675781},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/11786986_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11786986_41","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"doi:10.1016/j.ic.2006.10.005","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ic.2006.10.005","pdf_url":null,"source":{"id":"https://openalex.org/S59933527","display_name":"Information and Computation","issn_l":"0890-5401","issn":["0890-5401","1090-2651"],"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":"Information and Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.159.4410","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.4410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.iastate.edu/~pavan/papers/reductions.pdf","raw_type":"text"},{"id":"mag:1561713832","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc13.html#HitchcockP06","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1483648039","https://openalex.org/W1491368976","https://openalex.org/W1510439348","https://openalex.org/W1552748144","https://openalex.org/W1697825390","https://openalex.org/W1964450092","https://openalex.org/W1972216634","https://openalex.org/W1974647909","https://openalex.org/W1997491141","https://openalex.org/W2000232962","https://openalex.org/W2002517931","https://openalex.org/W2020158619","https://openalex.org/W2033319692","https://openalex.org/W2044637393","https://openalex.org/W2046812405","https://openalex.org/W2066938865","https://openalex.org/W2068655609","https://openalex.org/W2068873365","https://openalex.org/W2070692345","https://openalex.org/W2078896977","https://openalex.org/W2080139332","https://openalex.org/W2090186532","https://openalex.org/W2104611150","https://openalex.org/W2106436148","https://openalex.org/W2141670786","https://openalex.org/W2169825513","https://openalex.org/W2176419554","https://openalex.org/W2180548934","https://openalex.org/W2268443045","https://openalex.org/W2589703756","https://openalex.org/W6608590381","https://openalex.org/W6676380668","https://openalex.org/W6679563633"],"related_works":["https://openalex.org/W2144718727","https://openalex.org/W1568724636","https://openalex.org/W2415632638","https://openalex.org/W1540149594","https://openalex.org/W2790699692","https://openalex.org/W2107786321","https://openalex.org/W2023336906","https://openalex.org/W2913624541","https://openalex.org/W2573925077","https://openalex.org/W2289098369","https://openalex.org/W2046812405","https://openalex.org/W3046490946","https://openalex.org/W1771706767","https://openalex.org/W2508395457","https://openalex.org/W2282170612","https://openalex.org/W2066804259","https://openalex.org/W176257112","https://openalex.org/W2469381561","https://openalex.org/W2004966370","https://openalex.org/W156977962"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}