{"id":"https://openalex.org/W3152990700","doi":"https://doi.org/10.1145/3406325.3451117","title":"Strong co-nondeterministic lower bounds for NP cannot be proved feasibly","display_name":"Strong co-nondeterministic lower bounds for NP cannot be proved feasibly","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3152990700","doi":"https://doi.org/10.1145/3406325.3451117","mag":"3152990700"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451117","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451117","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5059921367","display_name":"J\u00e1n Pich","orcid":"https://orcid.org/0000-0002-2731-1330"},"institutions":[{"id":"https://openalex.org/I202391551","display_name":"Czech Academy of Sciences","ror":"https://ror.org/053avzc18","country_code":"CZ","type":"government","lineage":["https://openalex.org/I202391551"]},{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["CZ","GB"],"is_corresponding":false,"raw_author_name":"J\u00e1n Pich","raw_affiliation_strings":["Czech Academy of Sciences, Czechia / University of Oxford, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Academy of Sciences, Czechia / University of Oxford, UK","institution_ids":["https://openalex.org/I202391551","https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085864294","display_name":"Rahul Santhanam","orcid":"https://orcid.org/0000-0002-8716-6091"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rahul Santhanam","raw_affiliation_strings":["University of Oxford, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4521,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.88660821,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"223","last_page":"233"},"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.9998999834060669,"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.9998999834060669,"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.9988999962806702,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9975000023841858,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.797799825668335},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.5644246339797974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4284036457538605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4118482768535614},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4080079197883606},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.31758439540863037},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.2029159963130951},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20217463374137878}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.797799825668335},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.5644246339797974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4284036457538605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4118482768535614},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4080079197883606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31758439540863037},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.2029159963130951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20217463374137878},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3406325.3451117","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451117","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:4bb0ed7a-1983-4d95-8296-ab973094292e","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:4bb0ed7a-1983-4d95-8296-ab973094292e","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Conference item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1563012911","https://openalex.org/W1979397185","https://openalex.org/W1980327536","https://openalex.org/W1998918799","https://openalex.org/W2272526326","https://openalex.org/W2495451020","https://openalex.org/W2551720480","https://openalex.org/W2972230457","https://openalex.org/W3034806751","https://openalex.org/W3082353674","https://openalex.org/W3102712431","https://openalex.org/W4210896998","https://openalex.org/W4241977206","https://openalex.org/W4251444040","https://openalex.org/W6605490584","https://openalex.org/W6608031758"],"related_works":["https://openalex.org/W1483438220","https://openalex.org/W2144557478","https://openalex.org/W2394532980","https://openalex.org/W2041317738","https://openalex.org/W1593050105","https://openalex.org/W2075449032","https://openalex.org/W2091556334","https://openalex.org/W2051933114","https://openalex.org/W2963209704","https://openalex.org/W2004966370"],"abstract_inverted_index":{"We":[0,53],"show":[1,55],"unconditionally":[2],"that":[3,22],"Cook\u2019s":[4],"theory":[5,41,48],"PV":[6],"formalizing":[7],"poly-time":[8,15],"reasoning":[9],"cannot":[10],"prove,":[11],"for":[12,39,60],"any":[13],"non-deterministic":[14],"machine":[16],"M":[17],"defining":[18],"a":[19,40,44],"language":[20],"L(M),":[21],"L(M)":[23],"is":[24],"inapproximable":[25],"by":[26],"co-nondeterministic":[27],"circuits":[28],"of":[29,46,49,63,68],"sub-exponential":[30],"size.":[31],"In":[32],"fact,":[33],"our":[34],"unprovability":[35,58],"result":[36],"holds":[37],"also":[38,54],"which":[42],"supports":[43],"fragment":[45],"Je\u0159\u00e1bek\u2019s":[47],"approximate":[50],"counting":[51],"APC1.":[52],"similar":[56],"unconditional":[57],"results":[59],"the":[61,66],"conjecture":[62],"Rudich":[64],"about":[65],"existence":[67],"super-bits.":[69]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}