PhD student at Zaporizhzhya National University, Ukraine. Studying approximation algorithms for scheduling and packing problems.
5 References for analogues of chromatic polynomials where colorings which differ only by permutation of colors are counted as the same aug 26 '11
1 Can we partition NP-complete problem into finite number of polynomially solvable problems? dec 22 '10