{"id":"https://openalex.org/W3003385925","doi":"https://doi.org/10.46298/lmcs-17(4:17)2021","title":"A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm","display_name":"A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm","publication_year":2021,"publication_date":"2021-12-13","ids":{"openalex":"https://openalex.org/W3003385925","doi":"https://doi.org/10.46298/lmcs-17(4:17)2021","mag":"3003385925"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-17(4:17)2021","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-17(4:17)2021","pdf_url":"https://lmcs.episciences.org/8832/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":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/8832/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040922782","display_name":"Michal Kouck\u00fd","orcid":"https://orcid.org/0000-0003-0808-2269"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michal Kouck\u00fd","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0808-2269","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109078443","display_name":"Vojt\u011bch R\u00f6dl","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vojt\u011bch R\u00f6dl","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5019353955","display_name":"Navid Talebanfard","orcid":"https://orcid.org/0000-0002-3524-9282"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Navid Talebanfard","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-3524-9282","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040922782"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01416728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 17, Issue 4","issue":null,"first_page":"181","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9300000071525574,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9300000071525574,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9243000149726868,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/hypergraph","display_name":"Hypergraph","score":0.8461679220199585},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.77813720703125},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7091511487960815},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5911062955856323},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5289340615272522},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5222350358963013},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4946138560771942},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48907285928726196},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.42844638228416443},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36368000507354736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24030771851539612},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10794782638549805},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.10180827975273132}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8461679220199585},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.77813720703125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7091511487960815},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5911062955856323},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5289340615272522},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5222350358963013},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4946138560771942},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48907285928726196},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.42844638228416443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36368000507354736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24030771851539612},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10794782638549805},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.10180827975273132},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.46298/lmcs-17(4:17)2021","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-17(4:17)2021","pdf_url":"https://lmcs.episciences.org/8832/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:eprints.whiterose.ac.uk:204341","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:arXiv.org:2105.06744","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.06744","pdf_url":"https://arxiv.org/pdf/2105.06744","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"},{"id":"mag:3161364918","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2105.06744v1","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:doaj.org/article:f63b1b3c4f7540ba83231ccde9a3b0b3","is_oa":true,"landing_page_url":"https://doaj.org/article/f63b1b3c4f7540ba83231ccde9a3b0b3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 17, Issue 4 (2021)","raw_type":"article"},{"id":"doi:10.48550/arxiv.2105.06744","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2105.06744","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:3003385925","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/corr/corr2105.html#abs-2105-06744","pdf_url":null,"source":{"id":"https://openalex.org/S4306509107","display_name":"Electron. Colloquium Comput. Complex.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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":{"id":"doi:10.46298/lmcs-17(4:17)2021","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-17(4:17)2021","pdf_url":"https://lmcs.episciences.org/8832/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":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3003385925.pdf","grobid_xml":"https://content.openalex.org/works/W3003385925.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W628361767","https://openalex.org/W1971289435","https://openalex.org/W1979753555","https://openalex.org/W2041171215","https://openalex.org/W2074359677","https://openalex.org/W2084384424","https://openalex.org/W2134514766","https://openalex.org/W2136687801","https://openalex.org/W2150412474","https://openalex.org/W2171680292","https://openalex.org/W2191626561","https://openalex.org/W2275373716","https://openalex.org/W2294619171","https://openalex.org/W2518509221","https://openalex.org/W2972514177"],"related_works":["https://openalex.org/W1558826913","https://openalex.org/W2957416585","https://openalex.org/W2962705766","https://openalex.org/W2392378295","https://openalex.org/W2794380282","https://openalex.org/W2540110070","https://openalex.org/W2962687770","https://openalex.org/W2583166324","https://openalex.org/W3202031576","https://openalex.org/W2963378411","https://openalex.org/W2610519684","https://openalex.org/W2071318745","https://openalex.org/W3171822569","https://openalex.org/W2027607915","https://openalex.org/W2883673176","https://openalex.org/W2570121038","https://openalex.org/W3160700943","https://openalex.org/W1988547891","https://openalex.org/W2951838648","https://openalex.org/W2963923487"],"abstract_inverted_index":{"We":[0,51,102],"show":[1,104],"that":[2,14,64,105],"for":[3,128],"every":[4,73],"$r":[5],"\\ge":[6],"2$":[7],"there":[8],"exists":[9],"$\\epsilon_r":[10],">":[11],"0$":[12],"such":[13,148],"any":[15],"$r$-uniform":[16],"hypergraph":[17,42],"with":[18,46,112,133],"$m$":[19],"edges":[20,35],"and":[21,87,97],"maximum":[22],"vertex":[23],"degree":[24,134],"$o(\\sqrt{m})$":[25],"contains":[26],"a":[27,144,149],"set":[28],"of":[29,38,67,99,108],"at":[30,47,77,135],"most":[31,48,78,136],"$(\\frac{1}{2}":[32],"-":[33,62,125],"\\epsilon_r)m$":[34],"the":[36,41,94],"removal":[37],"which":[39,72],"breaks":[40],"into":[43],"connected":[44],"components":[45],"$m/2$":[49],"edges.":[50],"use":[52],"this":[53],"to":[54],"give":[55,143],"an":[56],"algorithm":[57,92,146],"running":[58],"in":[59,71,76,119,122],"time":[60],"$d^{(1":[61],"\\epsilon_r)m}$":[63],"decides":[65],"satisfiability":[66],"$m$-variable":[68],"$(d,":[69],"k)$-CSPs":[70,111],"variable":[74,113],"appears":[75],"$r$":[79,86,115],"constraints,":[80],"where":[81],"$\\epsilon_r$":[82],"depends":[83],"only":[84],"on":[85,131],"$k\\in":[88],"o(\\sqrt{m})$.":[89],"Furthermore":[90,127],"our":[91],"solves":[93],"corresponding":[95],"#CSP-SAT":[96],"Max-CSP-SAT":[98],"these":[100],"CSPs.":[101],"also":[103],"CNF":[106],"representations":[107],"unsatisfiable":[109],"$(2,":[110,140],"frequency":[114],"can":[116],"be":[117],"refuted":[118],"tree-like":[120],"resolution":[121],"size":[123],"$2^{(1":[124],"\\epsilon_r)m}$.":[126],"Tseitin":[129],"formulas":[130],"graphs":[132],"$k$":[137],"(which":[138],"are":[139],"k)$-CSPs)":[141],"we":[142],"deterministic":[145],"finding":[147],"refutation.":[150]},"counts_by_year":[],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}