{"id":"https://openalex.org/W4408312325","doi":"https://doi.org/10.46298/lmcs-21(1:23)2025","title":"Proof complexity of positive branching programs","display_name":"Proof complexity of positive branching programs","publication_year":2025,"publication_date":"2025-03-11","ids":{"openalex":"https://openalex.org/W4408312325","doi":"https://doi.org/10.46298/lmcs-21(1:23)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(1:23)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:23)2025","pdf_url":"https://lmcs.episciences.org/15354/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":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/15354/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089810498","display_name":"Anupam Das","orcid":"https://orcid.org/0000-0002-0142-3676"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anupam Das","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5071355541","display_name":"Avgerinos Delkos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Avgerinos Delkos","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089810498"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06186305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9897000193595886,"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/T11567","display_name":"semigroups and automata theory","score":0.9897000193595886,"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.9865000247955322,"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.9837999939918518,"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/branching","display_name":"Branching (polymer chemistry)","score":0.5777482986450195},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5270854830741882},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3864583671092987},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35758090019226074},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3282673954963684},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.06185069680213928}],"concepts":[{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5777482986450195},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5270854830741882},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3864583671092987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35758090019226074},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3282673954963684},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.06185069680213928},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/lmcs-21(1:23)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:23)2025","pdf_url":"https://lmcs.episciences.org/15354/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:doaj.org/article:e5cc4c350422426e86448db1b4dbb205","is_oa":true,"landing_page_url":"https://doaj.org/article/e5cc4c350422426e86448db1b4dbb205","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 1 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(1:23)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:23)2025","pdf_url":"https://lmcs.episciences.org/15354/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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4408312325.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"We":[0],"investigate":[1],"the":[2,75,85,104,112,171,195],"proof":[3,56,135],"complexity":[4,57],"of":[5,46,58,80,162,177,194],"systems":[6,96],"based":[7],"on":[8],"positive":[9,44,99,132],"branching":[10,14],"programs,":[11],"i.e.":[12],"non-deterministic":[13],"programs":[15],"(NBPs)":[16],"where,":[17],"for":[18,143],"any":[19],"0-transition":[20],"between":[21],"two":[22],"nodes,":[23],"there":[24],"is":[25,91,109,125,137],"also":[26],"a":[27,43,78,98,140,155,187],"1-transition.":[28],"Positive":[29],"NBPs":[30,59],"compute":[31],"monotone":[32],"Boolean":[33],"functions,":[34],"just":[35],"like":[36],"negation-free":[37,120],"circuits":[38],"or":[39,52],"formulas,":[40],"but":[41],"constitute":[42],"version":[45],"(non-uniform)":[47],"NL,":[48],"rather":[49],"than":[50],"P":[51],"NC1,":[53],"respectively.":[54],"The":[55],"was":[60,151],"investigated":[61],"in":[62],"previous":[63],"work":[64],"by":[65,93,117,139,145,182],"Buss,":[66,165],"Das":[67],"and":[68,148,164,168],"Knop,":[69],"using":[70],"extension":[71],"variables":[72],"to":[73,97,102,119,154],"represent":[74],"dag-structure,":[76],"over":[77,131],"language":[79],"(non-deterministic)":[81],"decision":[82],"trees,":[83],"yielding":[84],"system":[86,89],"eLNDT.":[87],"Our":[88,122,134],"eLNDT+":[90,127,181],"obtained":[92,110],"restricting":[94,118],"their":[95],"syntax,":[100],"similarly":[101],"how":[103],"'monotone":[105],"sequent":[106,114],"calculus'":[107],"MLK":[108,144],"from":[111],"usual":[113],"calculus":[115],"LK":[116],"formulas.":[121],"main":[123],"result":[124,142],"that":[126,150],"polynomially":[128],"simulates":[129],"eLNDT":[130],"sequents.":[133],"method":[136],"inspired":[138],"similar":[141],"Atserias,":[146],"Galesi":[147],"Pudl\\'ak,":[149],"recently":[152],"improved":[153],"bona":[156],"fide":[157],"polynomial":[158],"simulation":[159],"via":[160],"works":[161],"Je\\v{r}\\'abek":[163],"Kabanets,":[166],"Kolokolova":[167],"Kouck\\'y.":[169],"Along":[170],"way":[172],"we":[173],"formalise":[174],"several":[175],"properties":[176],"counting":[178],"functions":[179],"within":[180],"polynomial-size":[183,192],"proofs":[184],"and,":[185],"as":[186],"case":[188],"study,":[189],"give":[190],"explicit":[191],"poofs":[193],"propositional":[196],"pigeonhole":[197],"principle.":[198]},"counts_by_year":[],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2025-10-10T00:00:00"}