6 citations · 23 across the 15 of their papers we have counts for
1 paper · 1 filter
Gabor Kun, Jaroslav Nesetril
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by mea…