{"id":"https://openalex.org/W2947353914","doi":"https://doi.org/10.23638/lmcs-16(2:12)2020","title":"Consistency of circuit lower bounds with bounded theories","display_name":"Consistency of circuit lower bounds with bounded theories","publication_year":2020,"publication_date":"2020-06-18","ids":{"openalex":"https://openalex.org/W2947353914","doi":"https://doi.org/10.23638/lmcs-16(2:12)2020","mag":"2947353914"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-16(2:12)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(2:12)2020","pdf_url":"https://lmcs.episciences.org/6576/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/6576/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036648509","display_name":"Jan Byd\u017eovsk\u00fd","orcid":"https://orcid.org/0000-0003-2240-0147"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jan Bydzovsky","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069803587","display_name":"Jan Kraj\u0131\u0301\u010dek","orcid":"https://orcid.org/0000-0003-0670-3957"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jan Krajicek","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110785998","display_name":"Igor Carboni Oliveira","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Igor C. Oliveira","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2535,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57666887,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 16, Issue 2","issue":null,"first_page":null,"last_page":null},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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/T10142","display_name":"Formal Methods in Verification","score":0.9962000250816345,"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/bounded-function","display_name":"Bounded function","score":0.5728107690811157},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5671283602714539},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5426183342933655},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5228065252304077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.522648811340332},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46870607137680054},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.448886513710022},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.4432965815067291},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44118908047676086},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4161187410354614},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.20467859506607056},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09241318702697754}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5728107690811157},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5671283602714539},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5426183342933655},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5228065252304077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.522648811340332},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46870607137680054},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.448886513710022},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.4432965815067291},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44118908047676086},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4161187410354614},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.20467859506607056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09241318702697754},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.23638/lmcs-16(2:12)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(2:12)2020","pdf_url":"https://lmcs.episciences.org/6576/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1905.12935","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1905.12935","pdf_url":"https://arxiv.org/pdf/1905.12935","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1905.12935","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1905.12935","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:3046803118","is_oa":true,"landing_page_url":"https://dblp.uni-trier.de/db/journals/lmcs/lmcs16.html#BydzovskyKO20","pdf_url":null,"source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Logical Methods in Computer Science","raw_type":null}],"best_oa_location":{"id":"doi:10.23638/lmcs-16(2:12)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(2:12)2020","pdf_url":"https://lmcs.episciences.org/6576/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G267624678","display_name":null,"funder_award_id":"615075","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5702163051","display_name":null,"funder_award_id":"FP7/2007","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5806042582","display_name":null,"funder_award_id":"P 31955","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2947353914.pdf"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W112858668","https://openalex.org/W641573107","https://openalex.org/W1489496002","https://openalex.org/W1544916020","https://openalex.org/W1563012911","https://openalex.org/W1607926272","https://openalex.org/W1614370253","https://openalex.org/W1973023438","https://openalex.org/W1977921381","https://openalex.org/W1981324778","https://openalex.org/W1984477611","https://openalex.org/W1989076199","https://openalex.org/W1989978772","https://openalex.org/W2011047736","https://openalex.org/W2011612028","https://openalex.org/W2029576333","https://openalex.org/W2030202224","https://openalex.org/W2054191060","https://openalex.org/W2071204190","https://openalex.org/W2087012565","https://openalex.org/W2089546742","https://openalex.org/W2091961944","https://openalex.org/W2092429268","https://openalex.org/W2107771176","https://openalex.org/W2116335551","https://openalex.org/W2123776260","https://openalex.org/W2125894854","https://openalex.org/W2126270200","https://openalex.org/W2127883677","https://openalex.org/W2151586869","https://openalex.org/W2152454366","https://openalex.org/W2169644995","https://openalex.org/W2169748287","https://openalex.org/W2170007444","https://openalex.org/W2177219880","https://openalex.org/W2184467059","https://openalex.org/W2185541742","https://openalex.org/W2296103289","https://openalex.org/W2296506534","https://openalex.org/W2574746104","https://openalex.org/W2736246298","https://openalex.org/W2767976260","https://openalex.org/W2809266875","https://openalex.org/W2888826740","https://openalex.org/W2944371034","https://openalex.org/W2948979199","https://openalex.org/W2964143682","https://openalex.org/W2964773335"],"related_works":["https://openalex.org/W2099785256","https://openalex.org/W187835144","https://openalex.org/W315696179","https://openalex.org/W4288055874","https://openalex.org/W2186044446","https://openalex.org/W2945126541","https://openalex.org/W3196023996","https://openalex.org/W1533619009","https://openalex.org/W2509713809","https://openalex.org/W47204537"],"abstract_inverted_index":{"Proving":[0],"that":[1,7,35,68,83,91,125,138],"there":[2],"are":[3,25,39,218],"problems":[4,38,57],"in":[5,18,58],"$\\mathsf{P}^\\mathsf{NP}$":[6],"require":[8],"boolean":[9],"circuits":[10],"of":[11,64,87,118,151,196,211,225,232],"super-linear":[12],"size":[13],"is":[14,53,93,133,149,195],"a":[15,84,209],"major":[16],"frontier":[17],"complexity":[19,29,114],"theory.":[20],"While":[21],"such":[22,207],"lower":[23,51,66,233],"bounds":[24,52,67,189,234],"known":[26],"for":[27,56,70,126,190],"larger":[28],"classes,":[30],"existing":[31],"results":[32],"only":[33],"show":[34,82],"the":[36,61,77,104,116,152,191,199,212,230],"corresponding":[37,192],"hard":[40],"on":[41,222,229],"infinitely":[42,95,185],"many":[43],"input":[44,73],"lengths.":[45],"For":[46],"instance,":[47],"proving":[48,65],"almost-everywhere":[49],"circuit":[50,113,187],"open":[54],"even":[55],"$\\mathsf{MAEXP}$.":[59],"Giving":[60],"notorious":[62],"difficulty":[63],"hold":[69],"all":[71],"large":[72,85],"lengths,":[74],"we":[75,81,111,123],"ask":[76],"following":[78],"question:":[79],"Can":[80],"set":[86],"techniques":[88],"cannot":[89,183],"prove":[90,124],"$\\mathsf{NP}$":[92],"easy":[94],"often?":[96],"Motivated":[97],"by":[98],"this":[99],"and":[100,109,157,165,173,220,227],"related":[101],"questions":[102],"about":[103],"interaction":[105],"between":[106],"mathematical":[107],"proofs":[108],"computations,":[110],"investigate":[112],"from":[115],"perspective":[117],"logic.":[119],"Among":[120],"other":[121,179],"results,":[122],"any":[127],"parameter":[128],"$k":[129],"\\geq":[130],"1$":[131],"it":[132],"consistent":[134],"with":[135,235],"theory":[136,201],"$T$":[137],"computational":[139],"class":[140],"${\\mathcal":[141,158,166,174],"C}":[142,159,167,175],"\\not":[143],"\\subseteq":[144],"\\textit{i.o.}\\mathrm{SIZE}(n^k)$,":[145],"where":[146],"$(T,":[147],"\\mathcal{C})$":[148],"one":[150],"pairs:":[153],"$T":[154,162,170],"=":[155,160,163,168,171,176],"\\mathsf{T}^1_2$":[156],"\\mathsf{P}^\\mathsf{NP}$,":[161],"\\mathsf{S}^1_2$":[164],"\\mathsf{NP}$,":[169],"\\mathsf{PV}$":[172],"\\mathsf{P}$.":[177],"In":[178],"words,":[180],"these":[181],"theories":[182],"establish":[184],"often":[186],"upper":[188],"problems.":[193],"This":[194],"interest":[197],"because":[198],"weaker":[200],"$\\mathsf{PV}$":[202],"already":[203],"formalizes":[204],"sophisticated":[205],"arguments,":[206],"as":[208],"proof":[210],"PCP":[213],"Theorem.":[214],"These":[215],"consistency":[216,231],"statements":[217],"unconditional":[219],"improve":[221],"earlier":[223],"theorems":[224],"[KO17]":[226],"[BM18]":[228],"$\\mathsf{PV}$.":[236]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}