A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm

Michal Koucký, Vojtech Rödl, Navid Talebanfard. A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Electronic Colloquium on Computational Complexity (ECCC), 26:181, 2019. [doi]

@article{KouckyRT19,
  title = {A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm},
  author = {Michal Koucký and Vojtech Rödl and Navid Talebanfard},
  year = {2019},
  url = {https://eccc.weizmann.ac.il/report/2019/181},
  researchr = {https://researchr.org/publication/KouckyRT19},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {26},
  pages = {181},
}