{"id":"https://openalex.org/W3172953073","doi":"https://doi.org/10.1145/3406325.3451010","title":"Iterated lower bound formulas: a diagonalization-based approach to proof complexity","display_name":"Iterated lower bound formulas: a diagonalization-based approach to proof complexity","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3172953073","doi":"https://doi.org/10.1145/3406325.3451010","mag":"3172953073"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451010","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451010","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/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"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066962007","display_name":"Iddo Tzameret","orcid":"https://orcid.org/0000-0002-5558-9911"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Iddo Tzameret","raw_affiliation_strings":["Imperial College London, UK"],"raw_orcid":"https://orcid.org/0000-0002-5558-9911","affiliations":[{"raw_affiliation_string":"Imperial College London, UK","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6191,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.81816367,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"28","issue":null,"first_page":"234","last_page":"247"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9987999796867371,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/proof-complexity","display_name":"Proof complexity","score":0.8138010501861572},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.7092767953872681},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6866953372955322},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5463689565658569},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5408236980438232},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5227841734886169},{"id":"https://openalex.org/keywords/proof-of-concept","display_name":"Proof of concept","score":0.5120607018470764},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.45065826177597046},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42035025358200073},{"id":"https://openalex.org/keywords/direct-proof","display_name":"Direct proof","score":0.41696983575820923},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4133252203464508},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40233296155929565},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.37608033418655396},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3543244004249573},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.3189941942691803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3075629472732544},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.13443219661712646}],"concepts":[{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.8138010501861572},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.7092767953872681},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6866953372955322},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5463689565658569},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5408236980438232},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5227841734886169},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.5120607018470764},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.45065826177597046},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42035025358200073},{"id":"https://openalex.org/C161505775","wikidata":"https://www.wikidata.org/wiki/Q3240280","display_name":"Direct proof","level":2,"score":0.41696983575820923},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4133252203464508},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40233296155929565},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.37608033418655396},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3543244004249573},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3189941942691803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3075629472732544},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.13443219661712646},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3406325.3451010","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451010","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:spiral.imperial.ac.uk:10044/1/93966","is_oa":false,"landing_page_url":"http://hdl.handle.net/10044/1/93966","pdf_url":null,"source":{"id":"https://openalex.org/S4306401396","display_name":"Spiral (Imperial College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I47508984","host_organization_name":"Imperial College London","host_organization_lineage":["https://openalex.org/I47508984"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"Conference Paper"},{"id":"mag:3211036520","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc28.html#SanthanamT21","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electron. Colloquium Comput. Complex.","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4466506010","display_name":null,"funder_award_id":"615075","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W201320490","https://openalex.org/W1566084191","https://openalex.org/W1964394232","https://openalex.org/W1988083342","https://openalex.org/W2006912660","https://openalex.org/W2026944800","https://openalex.org/W2029390834","https://openalex.org/W2044632231","https://openalex.org/W2069767473","https://openalex.org/W2074374872","https://openalex.org/W2075488709","https://openalex.org/W2082560626","https://openalex.org/W2109720437","https://openalex.org/W2114400329","https://openalex.org/W2166026605","https://openalex.org/W2167115661","https://openalex.org/W2169713712","https://openalex.org/W2170831059","https://openalex.org/W2323554188","https://openalex.org/W2427215049","https://openalex.org/W2611339529","https://openalex.org/W2903251947","https://openalex.org/W2912080987","https://openalex.org/W2914732100","https://openalex.org/W2962731772","https://openalex.org/W2963930882","https://openalex.org/W2972230457","https://openalex.org/W2989887679","https://openalex.org/W3081705035","https://openalex.org/W3105062377","https://openalex.org/W4239243811"],"related_works":["https://openalex.org/W2922318846","https://openalex.org/W4295538670","https://openalex.org/W2151894250","https://openalex.org/W4312475206","https://openalex.org/W4387322292","https://openalex.org/W2263677784","https://openalex.org/W3189967158","https://openalex.org/W2162495973","https://openalex.org/W1496026483","https://openalex.org/W2786297759"],"abstract_inverted_index":{"We":[0,12],"propose":[1],"a":[2],"diagonalization-based":[3],"approach":[4,15],"to":[5],"several":[6],"important":[7],"questions":[8],"in":[9,16,26],"proof":[10,22,31],"complexity.":[11],"illustrate":[13],"this":[14],"the":[17,20,27],"context":[18,28],"of":[19,29],"algebraic":[21],"system":[23],"IPS":[24],"and":[25],"propositional":[30],"systems":[32],"more":[33],"generally.":[34]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}
