{"id":"https://openalex.org/W1776819099","doi":"https://doi.org/10.1145/2956229","title":"Small Depth Proof Systems","display_name":"Small Depth Proof Systems","publication_year":2016,"publication_date":"2016-10-21","ids":{"openalex":"https://openalex.org/W1776819099","doi":"https://doi.org/10.1145/2956229","mag":"1776819099"},"language":"en","primary_location":{"id":"doi:10.1145/2956229","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2956229","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","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/A5011977613","display_name":"Andreas Krebs","orcid":null},"institutions":[{"id":"https://openalex.org/I8087733","display_name":"University of T\u00fcbingen","ror":"https://ror.org/03a1kwz48","country_code":"DE","type":"education","lineage":["https://openalex.org/I8087733"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Krebs","raw_affiliation_strings":["University of T\u00fcbingen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of T\u00fcbingen, Germany","institution_ids":["https://openalex.org/I8087733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083072245","display_name":"Nutan Limaye","orcid":"https://orcid.org/0000-0002-0238-1674"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Nutan Limaye","raw_affiliation_strings":["Indian Institute of Technology, Bombay, India","Indian Institute of Technology, Bombay, India;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Bombay, India","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"Indian Institute of Technology, Bombay, India;","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020709378","display_name":"Meena Mahajan","orcid":"https://orcid.org/0000-0002-9116-4398"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Meena Mahajan","raw_affiliation_strings":["The Institute of Mathematical Sciences, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053184300","display_name":"Karteek Sreenivasaiah","orcid":"https://orcid.org/0000-0001-7396-3383"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karteek Sreenivasaiah","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00544209,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"9","issue":"1","first_page":"1","last_page":"26"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"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/T11567","display_name":"semigroups and automata theory","score":0.9944999814033508,"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/reachability","display_name":"Reachability","score":0.9261112809181213},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.7416666746139526},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5766441822052002},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5732067227363586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5443470478057861},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5355525016784668},{"id":"https://openalex.org/keywords/direct-proof","display_name":"Direct proof","score":0.4927397072315216},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.47598519921302795},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.44364821910858154},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.43167567253112793},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4259988069534302},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4174412488937378},{"id":"https://openalex.org/keywords/analytic-proof","display_name":"Analytic proof","score":0.4114362299442291},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3926065266132355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37293553352355957},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2596389949321747}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9261112809181213},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.7416666746139526},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5766441822052002},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5732067227363586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5443470478057861},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5355525016784668},{"id":"https://openalex.org/C161505775","wikidata":"https://www.wikidata.org/wiki/Q3240280","display_name":"Direct proof","level":2,"score":0.4927397072315216},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.47598519921302795},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.44364821910858154},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.43167567253112793},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4259988069534302},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4174412488937378},{"id":"https://openalex.org/C135754263","wikidata":"https://www.wikidata.org/wiki/Q4751136","display_name":"Analytic proof","level":3,"score":0.4114362299442291},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3926065266132355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37293553352355957},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2596389949321747},{"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/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"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},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2956229","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2956229","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1501317939","https://openalex.org/W1524807471","https://openalex.org/W1533271350","https://openalex.org/W1567053297","https://openalex.org/W1590283810","https://openalex.org/W1988083342","https://openalex.org/W1996660205","https://openalex.org/W2002089154","https://openalex.org/W2010465749","https://openalex.org/W2014860393","https://openalex.org/W2024450183","https://openalex.org/W2036265926","https://openalex.org/W2043360684","https://openalex.org/W2049516232","https://openalex.org/W2051700974","https://openalex.org/W2059785423","https://openalex.org/W2060270693","https://openalex.org/W2071260871","https://openalex.org/W2077543142","https://openalex.org/W2087012565","https://openalex.org/W2098308941","https://openalex.org/W2104952158","https://openalex.org/W2106155109","https://openalex.org/W2165293955","https://openalex.org/W2166162093","https://openalex.org/W2264390715","https://openalex.org/W2324049880","https://openalex.org/W2963771155","https://openalex.org/W4240781210"],"related_works":["https://openalex.org/W2922318846","https://openalex.org/W4206380335","https://openalex.org/W4226080508","https://openalex.org/W2461509449","https://openalex.org/W1541513585","https://openalex.org/W171706349","https://openalex.org/W2550963588","https://openalex.org/W4234403895","https://openalex.org/W153148314","https://openalex.org/W4313126845"],"abstract_inverted_index":{"A":[0],"proof":[1,26,37,49,94,117,135,149,169,182,215,234,252,261,288],"system":[2],"for":[3,116,251,254,263],"a":[4,8,29,98,105,139,264],"language":[5],"L":[6,18],"is":[7,16,48,155,192,239,249],"function":[9],"f":[10,14],"such":[11,93],"that":[12,39,51,126,161,208,224,260],"Range(":[13],")":[15,64,71],"exactly":[17,110],".":[19],"In":[20,242],"this":[21,154,185],"article,":[22],"we":[23,46,114,199,258],"look":[24],"at":[25],"systems":[27,38,50,95,118,150,253,262],"from":[28,138],"circuit":[30],"complexity":[31],"point":[32],"of":[33,59,66,100,175,245,267,277],"view":[34],"and":[35,137,189,228],"study":[36,47],"are":[40],"computationally":[41],"very":[42,88],"restricted.":[43],"The":[44],"restriction":[45],"can":[52],"be":[53],"computed":[54],"by":[55],"bounded":[56],"fanin":[57],"circuits":[58],"constant":[60],"depth":[61,72],"(NC":[62],"0":[63,81,134,148,168,181,214,233,279,284,287],"or":[65,285],"O":[67,75],"(log":[68],"log":[69,79,132,166],"n":[70],"but":[73,236],"with":[74],"(1)":[76],"alternations":[77],"(poly":[78],"AC":[80,133,167,278],").":[82],"Each":[83],"output":[84],"bit":[85],"depends":[86],"on":[87,104],"few":[89],"input":[90],"bits;":[91],"thus":[92],"correspond":[96],"to":[97,119,195],"kind":[99],"local":[101],"error":[102],"correction":[103],"theorem-proof":[106],"pair.":[107],"We":[108,124,171,206,221],"identify":[109],"how":[111,246],"much":[112,247],"power":[113,248,276],"need":[115,273],"capture":[120],"all":[121,127],"regular":[122,128],"languages.":[123],"show":[125,207,223],"languages":[129,255,268],"have":[130,231,282],"poly":[131,165],"systems,":[136,216,235],"previous":[140],"result":[141],"(Beyersdorff":[142],"et":[143],"al.":[144],"[2011a],":[145],"where":[146],"NC":[147,180,213,232],"were":[151],"first":[152],"introduced),":[153],"tight.":[156],"Our":[157],"technique":[158],"also":[159],"shows":[160],"M":[162],"aj":[163],"has":[164,179,212],"system.":[170],"explore":[172],"the":[173,201,243,274],"question":[174,186,203],"whether":[176],"T":[177],"aut":[178],"systems.":[183,289],"Addressing":[184],"about":[187,204],"2TAUT,":[188],"since":[190],"2TAUT":[191],"closely":[193],"related":[194],"reachability":[196,211],"in":[197,256,269],"graphs,":[198],"ask":[200],"same":[202],"Reachability.":[205],"if":[209],"Directed":[210,229,237],"then":[217,222],"so":[218],"does":[219],"2TAUT.":[220],"both":[225],"Undirected":[226],"Reachability":[227,238],"UnReachability":[230],"still":[240],"open.":[241],"context":[244],"needed":[250],"NP,":[257],"observe":[259],"good":[265],"fraction":[266],"NP":[270],"do":[271],"not":[272],"full":[275],";":[280],"they":[281],"SAC":[283],"coSAC":[286]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}