2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.CC2007★ 2 cited
NP by means of lifts and shadows
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…
math.CO2007
Forbidden lists (NP and CSP for combinatorialists)
Gabor Kun, Jaroslav Nesetril
We present a definition of the class NP in combinatorial context as the set of languages of structures defined by finitely many forbidden lifted substructures. We apply this to spe…
math.NT2005
Prime values of reducible polynomials, II
Yong-Gao Chen, Gabor Kun, Gabor Pete +2
The Schinzel hypothesis claims (but it seems hopeless to prove) that any irreducible Q[x] polynomial without a constant factor assumes infinitely many prime values at integer place…