Fortune, Steven A note on sparse complete sets. (English) Zbl 0415.68006 SIAM J. Comput. 8, 431-433 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 28 Documents MSC: 68Q25 Analysis of algorithms and problem complexity Keywords:Np-completeness; sparse complete sets; polynomial time reduction Citations:Zbl 0356.68059; Zbl 0382.68068 PDF BibTeX XML Cite \textit{S. Fortune}, SIAM J. Comput. 8, 431--433 (1979; Zbl 0415.68006) Full Text: DOI Link OpenURL