%0 Journal Article
%A D. I. Kogan
%A Yu. S. Fedosenko
%T The discretization problem: analysis of computational complexity, and polynomially solvable subclasses
%J Diskretnaya Matematika
%D 1996
%P 135-147
%V 8
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1996_8_3_a10/
%G ru
%F DM_1996_8_3_a10