{"id":"https://openalex.org/W2087012565","doi":"https://doi.org/10.2178/jsl/1203350791","title":"Consequences of the provability of <i>NP</i> \u2286 <i>P</i>/<i>poly</i>","display_name":"Consequences of the provability of <i>NP</i> \u2286 <i>P</i>/<i>poly</i>","publication_year":2007,"publication_date":"2007-12-01","ids":{"openalex":"https://openalex.org/W2087012565","doi":"https://doi.org/10.2178/jsl/1203350791","mag":"2087012565"},"language":"en","primary_location":{"id":"doi:10.2178/jsl/1203350791","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1203350791","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","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/A5034555443","display_name":"Stephen Cook","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]},{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CA","CZ"],"is_corresponding":false,"raw_author_name":"Stephen Cook","raw_affiliation_strings":["Academy of Sciences, Mathematical Institute, Zitna 25, Prague CZ-115 67, Czech Republic","University of Toronto, Department of Computer Science, Toronto, M5S 3G4, Canada. E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Academy of Sciences, Mathematical Institute, Zitna 25, Prague CZ-115 67, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]},{"raw_affiliation_string":"University of Toronto, Department of Computer Science, Toronto, M5S 3G4, Canada. E-mail:","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069803587","display_name":"Jan Kraj\u0131\u0301\u010dek","orcid":"https://orcid.org/0000-0003-0670-3957"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]},{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Kraj\u00ed\u010dek","raw_affiliation_strings":["Academy of Sciences, Mathematical Institute, Zitna 25, Prague CZ-115 67, Czech Republic","Charles University, Faculty of Mathematics and Physics, Sokolovsk\u00e1 83, 186 75 Prague, Czech Republic. E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Academy of Sciences, Mathematical Institute, Zitna 25, Prague CZ-115 67, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]},{"raw_affiliation_string":"Charles University, Faculty of Mathematics and Physics, Sokolovsk\u00e1 83, 186 75 Prague, Czech Republic. E-mail:","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.8914,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.96379035,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"72","issue":"4","first_page":"1353","last_page":"1371"},"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.9998000264167786,"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.9998000264167786,"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.998199999332428,"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/T10374","display_name":"Advanced Graph Theory Research","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"}}],"keywords":[{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.8229975700378418},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.6423925757408142},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6104985475540161},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5626893043518066},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5233339667320251},{"id":"https://openalex.org/keywords/p-versus-np-problem","display_name":"P versus NP problem","score":0.5175784826278687},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4898914694786072},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47126054763793945},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4457542896270752},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1200920045375824}],"concepts":[{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.8229975700378418},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.6423925757408142},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6104985475540161},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5626893043518066},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5233339667320251},{"id":"https://openalex.org/C186861659","wikidata":"https://www.wikidata.org/wiki/Q746242","display_name":"P versus NP problem","level":3,"score":0.5175784826278687},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4898914694786072},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47126054763793945},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4457542896270752},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1200920045375824},{"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2178/jsl/1203350791","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1203350791","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1203350791","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1203350791","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W9698083","https://openalex.org/W560364776","https://openalex.org/W572171498","https://openalex.org/W1512209815","https://openalex.org/W1970089350","https://openalex.org/W1983604941","https://openalex.org/W1985834822","https://openalex.org/W2063158069","https://openalex.org/W2071204190","https://openalex.org/W2089546742","https://openalex.org/W2091961944","https://openalex.org/W2112512535","https://openalex.org/W2128026324","https://openalex.org/W2160804094","https://openalex.org/W6911322511"],"related_works":["https://openalex.org/W4388962799","https://openalex.org/W2041517264","https://openalex.org/W1522180487","https://openalex.org/W4294789866","https://openalex.org/W1969386550","https://openalex.org/W2982557863","https://openalex.org/W1589381382","https://openalex.org/W266537895","https://openalex.org/W2294255905","https://openalex.org/W2791421781"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"prove":[2],"the":[3,33,38,63,82],"following":[4],"results:":[5],"(i)":[6],"PV":[7,14,24,30],"proves":[8,15,25,31,42,47,56,61,75,80],"NP":[9,18,26,43,57,69,76,88],"\u2286":[10,17,27,44,49,58,77],"P":[11,68,87],"/poly":[12],"iff":[13,46],"coNP":[16,48],"/":[19],"O":[20],"(1).":[21],"(ii)":[22],"If":[23,55,74],"P/poly":[28,45,59,78],"then":[29,60,79],"that":[32,62,81],"Polynomial":[34,64,83],"Hierarchy":[35,65,84],"collapses":[36,66,85],"to":[37,67,86],"Boolean":[39],"Hierarchy,":[40],"(iii)":[41],"NP/O":[50],"(log":[51],"n":[52,71],").":[53],"(iv)":[54],"[log":[70],"].":[72],"(v)":[73],".":[89],"Motivated":[90],"by":[91],"these":[92],"results":[93],"we":[94,107],"introduce":[95],"a":[96],"new":[97],"concept":[98],"in":[99],"proof":[100,102],"complexity:":[101],"systems":[103],"with":[104],"advice,":[105],"and":[106],"make":[108],"some":[109],"initial":[110],"observations":[111],"about":[112],"them.":[113]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":31},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}