Tag NP-complete
Tagged Works
10
2
1
1
1
1
1
1
1
1
1
1
- Computers and Intractability: A Guide to the Theory of NP-Completeness by M. R. Garey
- Combinatorial Algorithms by T. C. Hu
- Communications of the ACM, Volume 57, Number 5
- Parameterized Complexity (Monographs in Computer Science) by Rod G. Downey
- Algorithms from P to NP, Vol. I: Design and Efficiency by B. M. E. Moret
- Computer and job-shop scheduling theory by E. G. Coffman
- Computer Program Manl by T. C. Hu
- Meanwhile by Jason Shiga
- Ant Colony Optimization (Bradford Books) by Marco Dorigo
- Computational Complexity by Christos H. Papadimitriou
- The Algorithm Design Manual by Steven S. Skiena
- Introduction to the Theory of Computation by Michael Sipser
Using the Tag
bertilak (4), 4C-Library (2), cvaske (1), stefano (1), bwa32 (1), andersoj (1), cassiodorus (1), aqualectrix (1), idiosyncratic (1), peterdmark (1), chaimkut (1), LibrarySearch (1), llpollac (1), absurdness (1), scg (1), prosfilaes (1), ctaveras (1)
Related Series
Aliases and Translations
Includes: NP-complete, np-completeness, NP-completeness, np-complete, NP-Complete, NP-Completeness
Translations: NP-Vollständigkeit, NP-completo, Problème NP-complet, NP-Completo, NP-volledig, NP-komplett, Problem NP-zupełny, NP-completo, NP-полная задача, NP-úplný problém, НП-комплетни проблеми, NP-täydellisyys, NP-fullständig
Google Books Ngram Viewer
Data from Books Ngram Viewer