- Record: found
- Abstract: not found
- Article: not found
The NP-completeness column: an ongoing guide
Read this article at
ScienceOpenPublisher
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references44
- Record: found
- Abstract: not found
- Article: not found
The complexity of computing the permanent
L.G. Valiant (1979)
- Record: found
- Abstract: not found
- Article: not found
The ellipsoid method and its consequences in combinatorial optimization
M. Grötschel, L Lovász, A Schrijver (1981)
- Record: found
- Abstract: not found
- Article: not found
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Kellogg S. Booth, George S. Lueker (1976)