0551098 - MÚ 2022 RIV DE eng J - Journal Article
Koucký, M. - Rödl, V. - Talebanfard, Navid
A separator theorem for hypergraphs and a CSP-SAT algorithm.
Logical Methods in Computer Science. Roč. 17, č. 4 (2021), č. článku 17. ISSN 1860-5974. E-ISSN 1860-5974
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : computational complexity * logic in computer science * computer science
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 0.591, year: 2021
Method of publishing: Open access
https://doi.org/10.46298/lmcs-17(4:17)2021
Permanent Link: http://hdl.handle.net/11104/0326454
Koucký, M. - Rödl, V. - Talebanfard, Navid
A separator theorem for hypergraphs and a CSP-SAT algorithm.
Logical Methods in Computer Science. Roč. 17, č. 4 (2021), č. článku 17. ISSN 1860-5974. E-ISSN 1860-5974
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : computational complexity * logic in computer science * computer science
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 0.591, year: 2021
Method of publishing: Open access
https://doi.org/10.46298/lmcs-17(4:17)2021
Permanent Link: http://hdl.handle.net/11104/0326454