Arama Sonuçları NP-complete problems. - Daraltılmış: Computational complexity.SirsiDynix Enterprisehttps://katalog.hacettepe.edu.tr/client/tr_TR/default_tr/default_tr/qu$003dNP-complete$002bproblems.$0026qf$003dSUBJECT$002509Konu$002509Computational$002bcomplexity.$002509Computational$002bcomplexity.$0026ps$003d300?2026-05-14T22:25:15ZAn Introduction to Theory of Computation An Algorithmic Approachent://SD_ILS/0/SD_ILS:6079542026-05-14T22:25:15Z2026-05-14T22:25:15ZYazar Ogihara, Mitsunori. author. SpringerLink (Online service)<br/>Yer Numarası ONLINE<br/>Elektronik Erişim <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: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>Limits of computation : an introduction to the undecidable and the intractableent://SD_ILS/0/SD_ILS:5412002026-05-14T22:25:15Z2026-05-14T22:25:15ZYazar Reiter, Edna E. (Edna Elizabeth), author. Johnson, Clayton Matthew.<br/>Yer Numarası QA267.7 .R445 2013<br/>Elektronik Erişim <a href="https://www.taylorfrancis.com/books/9781439882078">Click here to view.</a><br/>Format: Kitap<br/>Durum Çevrimiçi Kütüphane~1<br/>