Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

The NP-completeness column: An ongoing guide

Johnson, David S

Journal of Algorithms , Volume 5 (2): 284-299 – Jun 1, 1984

Download PDF

The NP-completeness column: An ongoing guide

Johnson, David S

Journal of Algorithms , Volume 5 (2): 284-299 – Jun 1, 1984

Loading next page...

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher: CrossRef
ISSN: 0196-6774
DOI: 10.1016/0196-6774(84)90032-4
Publisher site: See Article on Publisher Site

References

A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension

Adler
Fast probabilistic algorithms for Hamiltonian circuits and matchings

Angluin
Canonical labelling of graphs in linear time

Babai