Arama Sonuçları MİT. - Daraltılmış: Computational complexity.
SirsiDynix Enterprise
https://katalog.hacettepe.edu.tr/client/tr_TR/default_tr/default_tr/qu$003dM$0025C4$0025B0T.$0026qf$003dSUBJECT$002509Konu$002509Computational$002bcomplexity.$002509Computational$002bcomplexity.$0026ps$003d300?
2024-11-13T16:57:33Z
Übungsbuch zur Linearen Algebra und analytischen Geometrie Aufgaben mit Lösungen
ent://SD_ILS/0/SD_ILS:193991
2024-11-13T16:57:33Z
2024-11-13T16:57:33Z
Yazar Lau, Dietlinde. author. SpringerLink (Online service)<br/>Yer Numarası ONLINE<br/>Elektronik Erişim <a href="http://dx.doi.org/10.1007/978-3-642-19278-4">http://dx.doi.org/10.1007/978-3-642-19278-4</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>
Übungsbuch zur Linearen Algebra und analytischen Geometrie Aufgaben mit Lösungen
ent://SD_ILS/0/SD_ILS:186581
2024-11-13T16:57:33Z
2024-11-13T16:57:33Z
Yazar Lau, Dietlinde. author. SpringerLink (Online service)<br/>Yer Numarası ONLINE<br/>Elektronik Erişim <a href="http://dx.doi.org/10.1007/978-3-540-72554-1">http://dx.doi.org/10.1007/978-3-540-72554-1</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>
Übungsaufgaben zur Mathematik für Informatiker und BioInformatiker Mit durchgerechneten und erklärten Lösungen
ent://SD_ILS/0/SD_ILS:182461
2024-11-13T16:57:33Z
2024-11-13T16:57:33Z
Yazar Wolff, Manfred. author. SpringerLink (Online service)<br/>Yer Numarası ONLINE<br/>Elektronik Erişim <a href="http://dx.doi.org/10.1007/3-540-30863-6">http://dx.doi.org/10.1007/3-540-30863-6</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>
Computational theories of interaction and agency
ent://SD_ILS/0/SD_ILS:220254
2024-11-13T16:57:33Z
2024-11-13T16:57:33Z
Yazar Agre, Philip. Rosenschein, Stanley J.<br/>Yer Numarası ONLINE<br/>Elektronik Erişim IEEE Xplore <a href="http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267506">http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267506</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>
Circuit complexity and neural networks
ent://SD_ILS/0/SD_ILS:219892
2024-11-13T16:57:33Z
2024-11-13T16:57:33Z
Yazar Parberry, Ian.<br/>Yer Numarası ONLINE<br/>Elektronik Erişim IEEE Xplore <a href="http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267424">http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267424</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>
Using hard problems to create pseudorandom generators
ent://SD_ILS/0/SD_ILS:220241
2024-11-13T16:57:33Z
2024-11-13T16:57:33Z
Yazar Nisan, Noam.<br/>Yer Numarası ONLINE<br/>Elektronik Erişim IEEE Xplore <a href="http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267312">http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267312</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>
Neural network design and the complexity of learning
ent://SD_ILS/0/SD_ILS:219883
2024-11-13T16:57:33Z
2024-11-13T16:57:33Z
Yazar Judd, J. Stephen.<br/>Yer Numarası ONLINE<br/>Elektronik Erişim IEEE Xplore <a href="http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267404">http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267404</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>
Communication complexity a new approach to circuit depth
ent://SD_ILS/0/SD_ILS:220119
2024-11-13T16:57:33Z
2024-11-13T16:57:33Z
Yazar Karchmer, Mauricio.<br/>Yer Numarası ONLINE<br/>Elektronik Erişim IEEE Xplore <a href="http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267292">http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267292</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>