Arama Sonu&ccedil;lar&#305; MIT Press, - Daralt&#305;lm&#305;&#351;: Computational complexity. SirsiDynix Enterprise https://katalog.hacettepe.edu.tr/client/tr_TR/default_tr/default_tr/qu$003dMIT$002bPress$00252C$0026qf$003dSUBJECT$002509Konu$002509Computational$002bcomplexity.$002509Computational$002bcomplexity.$0026ps$003d300? 2026-02-23T10:53:07Z Computational theories of interaction and agency ent://SD_ILS/0/SD_ILS:220254 2026-02-23T10:53:07Z 2026-02-23T10:53:07Z Yazar&#160;Agre, Philip.&#160;Rosenschein, Stanley J.<br/>Yer Numaras&#305;&#160;ONLINE<br/>Elektronik Eri&#351;im&#160;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:&#160;Elektrnik Kaynak<br/>Durum&#160;&Ccedil;evrimi&ccedil;i K&uuml;t&uuml;phane~1<br/> Circuit complexity and neural networks ent://SD_ILS/0/SD_ILS:219892 2026-02-23T10:53:07Z 2026-02-23T10:53:07Z Yazar&#160;Parberry, Ian.<br/>Yer Numaras&#305;&#160;ONLINE<br/>Elektronik Eri&#351;im&#160;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:&#160;Elektrnik Kaynak<br/>Durum&#160;&Ccedil;evrimi&ccedil;i K&uuml;t&uuml;phane~1<br/> Using hard problems to create pseudorandom generators ent://SD_ILS/0/SD_ILS:220241 2026-02-23T10:53:07Z 2026-02-23T10:53:07Z Yazar&#160;Nisan, Noam.<br/>Yer Numaras&#305;&#160;ONLINE<br/>Elektronik Eri&#351;im&#160;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:&#160;Elektrnik Kaynak<br/>Durum&#160;&Ccedil;evrimi&ccedil;i K&uuml;t&uuml;phane~1<br/> Neural network design and the complexity of learning ent://SD_ILS/0/SD_ILS:219883 2026-02-23T10:53:07Z 2026-02-23T10:53:07Z Yazar&#160;Judd, J. Stephen.<br/>Yer Numaras&#305;&#160;ONLINE<br/>Elektronik Eri&#351;im&#160;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:&#160;Elektrnik Kaynak<br/>Durum&#160;&Ccedil;evrimi&ccedil;i K&uuml;t&uuml;phane~1<br/> Communication complexity a new approach to circuit depth ent://SD_ILS/0/SD_ILS:220119 2026-02-23T10:53:07Z 2026-02-23T10:53:07Z Yazar&#160;Karchmer, Mauricio.<br/>Yer Numaras&#305;&#160;ONLINE<br/>Elektronik Eri&#351;im&#160;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:&#160;Elektrnik Kaynak<br/>Durum&#160;&Ccedil;evrimi&ccedil;i K&uuml;t&uuml;phane~1<br/>