{"id":"https://openalex.org/W4295696710","doi":"https://doi.org/10.48550/arxiv.2209.04567","title":"A general class of combinatorial filters that can be minimized efficiently","display_name":"A general class of combinatorial filters that can be minimized efficiently","publication_year":2022,"publication_date":"2022-09-10","ids":{"openalex":"https://openalex.org/W4295696710","doi":"https://doi.org/10.48550/arxiv.2209.04567"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2209.04567","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2209.04567","pdf_url":"https://arxiv.org/pdf/2209.04567","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":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2209.04567","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029749178","display_name":"Yulin Zhang","orcid":"https://orcid.org/0000-0003-1833-7456"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhang, Yulin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5035574727","display_name":"Dylan A. Shell","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shell, Dylan A.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029749178"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9301999807357788,"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.9301999807357788,"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/minification","display_name":"Minification","score":0.6114444732666016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5410548448562622},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.49427127838134766},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44922417402267456},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41913869976997375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34716135263442993},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3348194360733032},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17444241046905518}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6114444732666016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5410548448562622},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.49427127838134766},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44922417402267456},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41913869976997375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34716135263442993},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3348194360733032},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17444241046905518},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2209.04567","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2209.04567","pdf_url":"https://arxiv.org/pdf/2209.04567","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":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2209.04567","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2209.04567","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2209.04567","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2209.04567","pdf_url":"https://arxiv.org/pdf/2209.04567","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":"","raw_type":"text"},"sustainable_development_goals":[{"score":0.5799999833106995,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4295696710.pdf","grobid_xml":"https://content.openalex.org/works/W4295696710.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2532234348","https://openalex.org/W108084911","https://openalex.org/W2393440248","https://openalex.org/W3151522584","https://openalex.org/W1569386110","https://openalex.org/W1497123311","https://openalex.org/W2673314300","https://openalex.org/W2982169251","https://openalex.org/W2720892868","https://openalex.org/W2103406007"],"abstract_inverted_index":{"State":[0],"minimization":[1,20,123,153],"of":[2,33,57,76,91,140,151,165,182,197],"combinatorial":[3],"filters":[4,198],"is":[5,21,53,124],"a":[6,29,54,89,128,137],"fundamental":[7],"problem":[8],"that":[9,79,103,134,199],"arises,":[10],"for":[11,120,131,147],"example,":[12],"in":[13,154,163],"building":[14],"cheap,":[15],"resource-efficient":[16],"robots.":[17],"But":[18],"exact":[19,122],"known":[22,158],"to":[23,46,65,96,105,116,136,171],"be":[24],"NP-hard.":[25],"This":[26],"paper":[27],"conducts":[28],"more":[30],"nuanced":[31],"analysis":[32],"this":[34,47,112],"hardness":[35,60],"than":[36],"up":[37],"till":[38],"now,":[39],"and":[40,61,83,100],"uncovers":[41],"two":[42],"factors":[43],"which":[44,121,148],"contribute":[45],"complexity.":[48],"We":[49,126,191],"show":[50],"each":[51,164],"factor":[52],"distinct":[55,144],"source":[56],"the":[58,70,77,149,161,180,183],"problem's":[59],"are":[62,200],"able,":[63],"thereby,":[64],"shed":[66],"some":[67],"light":[68],"on":[69],"role":[71],"played":[72],"by":[73],"(1)":[74],"structure":[75],"graph":[78],"encodes":[80],"compatibility":[81],"relationships,":[82],"(2)":[84],"determinism-enforcing":[85],"constraints.":[86],"Just":[87],"as":[88],"line":[90],"prior":[92],"work":[93],"has":[94],"sought":[95],"introduce":[97,127],"additional":[98],"assumptions":[99],"identify":[101],"sub-classes":[102],"lead":[104],"practical":[106],"state":[107],"reduction,":[108],"we":[109],"next":[110],"use":[111],"new,":[113],"sharper":[114],"understanding":[115],"explore":[117],"special":[118,145],"cases":[119,146,168],"efficient.":[125],"new":[129,195],"algorithm":[130],"constraint":[132],"repair":[133],"applies":[135],"large":[138],"sub-class":[139],"filters,":[141],"subsuming":[142],"three":[143,167],"possibility":[150],"optimal":[152],"polynomial":[155],"time":[156],"was":[157],"earlier.":[159],"While":[160],"efficiency":[162],"these":[166],"previously":[169],"appeared":[170],"stem":[172],"from":[173],"seemingly":[174],"dissimilar":[175],"properties,":[176],"when":[177],"seen":[178],"through":[179],"lens":[181],"present":[184],"work,":[185],"their":[186],"commonality":[187],"now":[188],"becomes":[189],"clear.":[190],"also":[192],"provide":[193],"entirely":[194],"families":[196],"efficiently":[201],"reducible.":[202]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2022-09-14T00:00:00"}