22 citations · 35 across the 10 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LO2021
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm
Michal Koucký, Vojtěch Rödl, Navid Talebanfard
We show that for every there exists such that any -uniform hypergraph with edges and maximum vertex degree contains a set of at most $(\fra…
cs.CC2021
Data Structures Lower Bounds and Popular Conjectures
Pavel Dvořák, Michal Koucký, Karel Král +1
In this paper, we investigate the relative power of several conjectures that attracted recently lot of interest. We establish a connection between the Network Coding Conjecture (NC…