{"id":"https://openalex.org/W2907643987","doi":"https://doi.org/10.29007/5z5k","title":"Quasipolynomial Set-Based Symbolic Algorithms for Parity Games","display_name":"Quasipolynomial Set-Based Symbolic Algorithms for Parity Games","publication_year":2018,"publication_date":"2018-10-23","ids":{"openalex":"https://openalex.org/W2907643987","doi":"https://doi.org/10.29007/5z5k","mag":"2907643987"},"language":"en","primary_location":{"id":"doi:10.29007/5z5k","is_oa":true,"landing_page_url":"https://doi.org/10.29007/5z5k","pdf_url":"https://easychair.org/publications/open/L8b1","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/L8b1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Krishnendu Chatterjee","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Krishnendu Chatterjee","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Wolfgang Dvo\u0159\u00e1k","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wolfgang Dvo\u0159\u00e1k","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Monika Henzinger","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Monika Henzinger","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Alexander Svozil","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander Svozil","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4273,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.67755885,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"57","issue":null,"first_page":"233","last_page":"211"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9456999897956848,"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.9456999897956848,"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.009999999776482582,"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.009100000374019146,"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/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.7214000225067139},{"id":"https://openalex.org/keywords/symbolic-data-analysis","display_name":"Symbolic data analysis","score":0.6187999844551086},{"id":"https://openalex.org/keywords/the-symbolic","display_name":"The Symbolic","score":0.5960000157356262},{"id":"https://openalex.org/keywords/symbolic-computation","display_name":"Symbolic computation","score":0.5013999938964844},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.5009999871253967},{"id":"https://openalex.org/keywords/symbolic-numeric-computation","display_name":"Symbolic-numeric computation","score":0.44119998812675476},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.43230000138282776},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.375}],"concepts":[{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.7214000225067139},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.6187999844551086},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6090999841690063},{"id":"https://openalex.org/C2776095079","wikidata":"https://www.wikidata.org/wiki/Q489538","display_name":"The Symbolic","level":2,"score":0.5960000157356262},{"id":"https://openalex.org/C110812573","wikidata":"https://www.wikidata.org/wiki/Q175515","display_name":"Symbolic computation","level":2,"score":0.5013999938964844},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.5009999871253967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48489999771118164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46560001373291016},{"id":"https://openalex.org/C167324811","wikidata":"https://www.wikidata.org/wiki/Q12207781","display_name":"Symbolic-numeric computation","level":3,"score":0.44119998812675476},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3799000084400177},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.375},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.374099999666214},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C16101541","wikidata":"https://www.wikidata.org/wiki/Q1350838","display_name":"Symbolic dynamics","level":2,"score":0.33169999718666077},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3228999972343445},{"id":"https://openalex.org/C11219265","wikidata":"https://www.wikidata.org/wiki/Q5158734","display_name":"Concolic testing","level":4,"score":0.32269999384880066},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.31360000371932983},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2831000089645386},{"id":"https://openalex.org/C2779626591","wikidata":"https://www.wikidata.org/wiki/Q536936","display_name":"Symbolic power","level":3,"score":0.262800008058548}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.29007/5z5k","is_oa":true,"landing_page_url":"https://doi.org/10.29007/5z5k","pdf_url":"https://easychair.org/publications/open/L8b1","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1909.04983","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1909.04983","pdf_url":"https://arxiv.org/pdf/1909.04983","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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"}],"best_oa_location":{"id":"doi:10.29007/5z5k","is_oa":true,"landing_page_url":"https://doi.org/10.29007/5z5k","pdf_url":"https://easychair.org/publications/open/L8b1","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2907643987.pdf","grobid_xml":"https://content.openalex.org/works/W2907643987.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Solving":[0],"parity":[1,102,110,125,202,236],"games,":[2,42,71,126],"which":[3],"are":[4,134,169,193],"equivalent":[5],"to":[6],"modal":[7],"\u03bc-calculus":[8],"model":[9,36,46],"checking,":[10],"is":[11,49,82,117],"a":[12,118,175,197,241],"central":[13],"algorithmic":[14],"problem":[15],"in":[16,21,219,230],"formal":[17],"methods,":[18],"with":[19,37,98,106,112],"applications":[20],"reactive":[22],"synthesis,":[23],"program":[24],"repair,":[25],"verification":[26],"of":[27,41,47,51,70,79,121,190,264],"branching-time":[28],"properties,":[29],"etc.":[30],"Besides":[31],"the":[32,38,67,74,127,138,182,260],"standard":[33],"compu-":[34],"tation":[35],"explicit":[39,75,122,183,223],"representation":[40],"another":[43],"important":[44,188,261],"theoretical":[45],"computation":[48],"that":[50,83,141,155,204,245],"set-based":[52,131,177,198,232,242],"symbolic":[53,56,80,132,144,148,158,162,178,199,208,212,233,243,249,256,275,279],"algorithms.":[54],"Set-based":[55],"algorithms":[57,81,87,123,133,224],"use":[58],"basic":[59,139],"set":[60],"operations":[61,65,145,159,209,250,276],"and":[62,109,146,150,160,210,214,251,277],"one-step":[63],"predecessor":[64],"on":[66,104,181],"implicit":[68],"description":[69],"rather":[72],"than":[73],"representation.":[76],"The":[77],"significance":[78],"they":[84],"provide":[85],"scalable":[86],"for":[88,95,124,130,201,235,259],"large":[89],"finite-state":[90],"systems,":[91],"as":[92,94,135,170,194],"well":[93],"infinite-state":[96],"systems":[97],"finite":[99],"quotient.":[100],"Consider":[101],"games":[103,203],"graphs":[105],"n":[107],"vertices":[108],"conditions":[111],"d":[113,265],"priorities.":[114],"While":[115],"there":[116],"rich":[119],"literature":[120],"main":[128],"results":[129],"follows:":[136,171,195],"(a)":[137,196],"algorithm":[140,154,179,192,200,234,244,270],"requires":[142,156,205,246,271],"O(nd)":[143],"O(d)":[147],"space;":[149,213],"(b)":[151,215],"an":[152,227],"improved":[153],"O(nd/3+1)":[157],"O(n)":[161,211],"space.":[163,257,280],"In":[164],"this":[165],"work,":[166],"our":[167,191,231,269],"contributions":[168],"(1)":[172],"We":[173,239],"present":[174,240],"black-box":[176],"based":[180,222],"progress":[184,220],"measure":[185,221],"algorithm.":[186],"Two":[187],"consequences":[189],"quasi-polynomially":[206,247],"many":[207,248,274],"any":[216],"future":[217],"improvement":[218,229],"immediately":[225],"imply":[226],"efficiency":[228],"games.":[237],"(2)":[238],"O(d":[252],"\u00b7":[253],"log":[254,267],"n)":[255],"Moreover,":[258],"special":[262],"case":[263],"\u2264":[266],"n,":[268],"only":[272],"polynomially":[273],"poly-logarithmic":[278]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2019-01-11T00:00:00"}