{"id":"https://openalex.org/W2070692345","doi":"https://doi.org/10.1137/s0097539701387039","title":"Separation of NP-Completeness Notions","display_name":"Separation of NP-Completeness Notions","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2070692345","doi":"https://doi.org/10.1137/s0097539701387039","mag":"2070692345"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539701387039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701387039","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/A5112023986","display_name":"A. Pavan","orcid":"https://orcid.org/0000-0003-1665-5266"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. Pavan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051370311","display_name":"Alan L. Selman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alan L. Selman","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112023986"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.9317,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.95191036,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"3","first_page":"906","last_page":"918"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9968000054359436,"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.9968000054359436,"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.9930999875068665,"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.9890000224113464,"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.8060311079025269},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6109300851821899},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5542027950286865},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49410179257392883},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.49115654826164246},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4769262671470642},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2949020266532898},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23626163601875305}],"concepts":[{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.8060311079025269},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6109300851821899},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5542027950286865},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49410179257392883},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.49115654826164246},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4769262671470642},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2949020266532898},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23626163601875305},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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.1137/s0097539701387039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701387039","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1581655906","https://openalex.org/W1638203394","https://openalex.org/W1697825390","https://openalex.org/W1966945335","https://openalex.org/W1967283546","https://openalex.org/W1969728959","https://openalex.org/W1981282181","https://openalex.org/W1982717290","https://openalex.org/W1985343313","https://openalex.org/W1986203294","https://openalex.org/W1993138363","https://openalex.org/W1995293773","https://openalex.org/W2004243323","https://openalex.org/W2024309621","https://openalex.org/W2039334189","https://openalex.org/W2045334235","https://openalex.org/W2053392269","https://openalex.org/W2057512592","https://openalex.org/W2066804259","https://openalex.org/W2068655609","https://openalex.org/W2070150049","https://openalex.org/W2080139332","https://openalex.org/W2081902982","https://openalex.org/W2085634981","https://openalex.org/W2087899564","https://openalex.org/W2125495920","https://openalex.org/W2169825513","https://openalex.org/W2173911363","https://openalex.org/W2180548934","https://openalex.org/W2567019620","https://openalex.org/W2804621131","https://openalex.org/W4230960895","https://openalex.org/W4252071171"],"related_works":["https://openalex.org/W4237277701","https://openalex.org/W2121424666","https://openalex.org/W1587028174","https://openalex.org/W4301250310","https://openalex.org/W2055420561","https://openalex.org/W2067700950","https://openalex.org/W1669998927","https://openalex.org/W3162039195","https://openalex.org/W2071225893","https://openalex.org/W4250321999"],"abstract_inverted_index":{"We":[0,35],"use":[1],"hypotheses":[2,42],"of":[3,40],"structural":[4],"complexity":[5],"theory":[6],"to":[7],"separate":[8],"various":[9],"NP-completeness":[10],"notions.":[11],"In":[12],"particular,":[13],"we":[14,20,44],"introduce":[15],"an":[16],"hypothesis":[17],"from":[18],"which":[19],"describe":[21],"a":[22],"set":[23],"in":[24],"NP":[25],"that":[26,43],"is":[27],"$\\mbox{${\\leq}^{\\rm":[28,33],"P}_{\\rm":[29],"T}$}$-complete":[30],"but":[31],"not":[32],"P}_{tt}$}$-complete.":[34],"provide":[36],"fairly":[37],"thorough":[38],"analyses":[39],"the":[41],"introduce.":[45]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}