Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Dieu:1986:APT,
author = "Phan Dinh Dieu and Le Cong Thanh and Le Tuan Hoa",
title = "Average polynomial time complexity of some
{NP-complete} problems",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "219--237",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Inst. of Comput. Sci., Hanoi, Viet Nam",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "average polynomial time complexity; computational
complexity; deterministic algorithm; graph theory;
nonuniform distributions; NP-complete problems; set of
graphs",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}