Search Results for Computational complexity. - Narrowed by: Electronic Library - 1992
SirsiDynix Enterprise
https://katalog.hacettepe.edu.tr/client/en_US/default/default/qu$003dComputational$002bcomplexity.$0026qf$003dLOCATION$002509Shelf$002bLocation$0025091$00253AELEKKUTUPH$002509Electronic$002bLibrary$0026qf$003dPUBDATE$002509Publication$002bDate$0025091992$0025091992$0026ic$003dtrue$0026te$003dILS$0026ps$003d300$0026isd$003dtrue?
2024-09-06T03:42:26Z
Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity
ent://SD_ILS/0/SD_ILS:256787
2024-09-06T03:42:26Z
2024-09-06T03:42:26Z
Author Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (4th : 1990 : Prachatice, Czechoslovakia) Nešetřil, Jaroslav. Fiedler, Miroslav.<br/>Preferred Shelf Number ONLINE<br/>Electronic Access ScienceDirect <a href="http://www.sciencedirect.com/science/book/9780444895431">http://www.sciencedirect.com/science/book/9780444895431</a><br/>Format: Electronic Resources<br/>Availability Online Library~1<br/>
Using hard problems to create pseudorandom generators
ent://SD_ILS/0/SD_ILS:220241
2024-09-06T03:42:26Z
2024-09-06T03:42:26Z
Author Nisan, Noam.<br/>Preferred Shelf Number ONLINE<br/>Electronic Access 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: Electronic Resources<br/>Availability Online Library~1<br/>