Search Results for NP-complete problems. - Narrowed by: Computational complexity.SirsiDynix Enterprisehttps://katalog.hacettepe.edu.tr/client/en_US/default/default/qu$003dNP-complete$002bproblems.$0026qf$003dSUBJECT$002509Konu$002509Computational$002bcomplexity.$002509Computational$002bcomplexity.$0026ic$003dtrue$0026ps$003d300?2026-05-14T21:43:15ZAn Introduction to Theory of Computation An Algorithmic Approachent://SD_ILS/0/SD_ILS:6079542026-05-14T21:43:15Z2026-05-14T21:43:15ZAuthor Ogihara, Mitsunori. author. SpringerLink (Online service)<br/>Preferred Shelf Number ONLINE<br/>Electronic Access <a href="https://doi.org/10.1007/978-3-031-84740-0">https://doi.org/10.1007/978-3-031-84740-0</a><br/>Format: Electronic Resources<br/>Availability Online Library~1<br/>Limits of computation : an introduction to the undecidable and the intractableent://SD_ILS/0/SD_ILS:5412002026-05-14T21:43:15Z2026-05-14T21:43:15ZAuthor Reiter, Edna E. (Edna Elizabeth), author. Johnson, Clayton Matthew.<br/>Preferred Shelf Number QA267.7 .R445 2013<br/>Electronic Access <a href="https://www.taylorfrancis.com/books/9781439882078">Click here to view.</a><br/>Format: Books<br/>Availability Online Library~1<br/>