Search Results for Mit. - Narrowed by: Computational complexity. SirsiDynix Enterprise https://katalog.hacettepe.edu.tr/client/en_US/default/default/qu$003dMit.$0026qf$003dSUBJECT$002509Subject$002509Computational$002bcomplexity.$002509Computational$002bcomplexity.$0026pe$003dd$00253A$0026ps$003d300? 2024-11-13T22:12:30Z &Uuml;bungsbuch zur Linearen Algebra und analytischen Geometrie Aufgaben mit L&ouml;sungen ent://SD_ILS/0/SD_ILS:193991 2024-11-13T22:12:30Z 2024-11-13T22:12:30Z Author&#160;Lau, Dietlinde. author.&#160;SpringerLink (Online service)<br/>Preferred Shelf Number&#160;ONLINE<br/>Electronic Access&#160;<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:&#160;Electronic Resources<br/>Availability&#160;Online Library~1<br/> &Uuml;bungsbuch zur Linearen Algebra und analytischen Geometrie Aufgaben mit L&ouml;sungen ent://SD_ILS/0/SD_ILS:186581 2024-11-13T22:12:30Z 2024-11-13T22:12:30Z Author&#160;Lau, Dietlinde. author.&#160;SpringerLink (Online service)<br/>Preferred Shelf Number&#160;ONLINE<br/>Electronic Access&#160;<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:&#160;Electronic Resources<br/>Availability&#160;Online Library~1<br/> &Uuml;bungsaufgaben zur Mathematik f&uuml;r Informatiker und BioInformatiker Mit durchgerechneten und erkl&auml;rten L&ouml;sungen ent://SD_ILS/0/SD_ILS:182461 2024-11-13T22:12:30Z 2024-11-13T22:12:30Z Author&#160;Wolff, Manfred. author.&#160;SpringerLink (Online service)<br/>Preferred Shelf Number&#160;ONLINE<br/>Electronic Access&#160;<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:&#160;Electronic Resources<br/>Availability&#160;Online Library~1<br/> Computational theories of interaction and agency ent://SD_ILS/0/SD_ILS:220254 2024-11-13T22:12:30Z 2024-11-13T22:12:30Z Author&#160;Agre, Philip.&#160;Rosenschein, Stanley J.<br/>Preferred Shelf Number&#160;ONLINE<br/>Electronic Access&#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;Electronic Resources<br/>Availability&#160;Online Library~1<br/> Circuit complexity and neural networks ent://SD_ILS/0/SD_ILS:219892 2024-11-13T22:12:30Z 2024-11-13T22:12:30Z Author&#160;Parberry, Ian.<br/>Preferred Shelf Number&#160;ONLINE<br/>Electronic Access&#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;Electronic Resources<br/>Availability&#160;Online Library~1<br/> Using hard problems to create pseudorandom generators ent://SD_ILS/0/SD_ILS:220241 2024-11-13T22:12:30Z 2024-11-13T22:12:30Z Author&#160;Nisan, Noam.<br/>Preferred Shelf Number&#160;ONLINE<br/>Electronic Access&#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;Electronic Resources<br/>Availability&#160;Online Library~1<br/> Neural network design and the complexity of learning ent://SD_ILS/0/SD_ILS:219883 2024-11-13T22:12:30Z 2024-11-13T22:12:30Z Author&#160;Judd, J. Stephen.<br/>Preferred Shelf Number&#160;ONLINE<br/>Electronic Access&#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;Electronic Resources<br/>Availability&#160;Online Library~1<br/> Communication complexity a new approach to circuit depth ent://SD_ILS/0/SD_ILS:220119 2024-11-13T22:12:30Z 2024-11-13T22:12:30Z Author&#160;Karchmer, Mauricio.<br/>Preferred Shelf Number&#160;ONLINE<br/>Electronic Access&#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;Electronic Resources<br/>Availability&#160;Online Library~1<br/>