Arama Sonuçları Computational complexity. - Daraltılmış: 1992
SirsiDynix Enterprise
https://katalog.hacettepe.edu.tr/client/tr_TR/default_tr/default_tr/qu$003dComputational$002bcomplexity.$0026qf$003dPUBDATE$002509Yay$0025C4$0025B1n$002bY$0025C4$0025B1l$0025C4$0025B1$0025091992$0025091992$0026ps$003d300?dt=list
2024-11-29T01:08:50Z
Using hard problems to create pseudorandom generators
ent://SD_ILS/0/SD_ILS:220241
2024-11-29T01:08:50Z
2024-11-29T01:08:50Z
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/>
Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity
ent://SD_ILS/0/SD_ILS:256787
2024-11-29T01:08:50Z
2024-11-29T01:08:50Z
Yazar Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (4th : 1990 : Prachatice, Czechoslovakia) Nešetřil, Jaroslav. Fiedler, Miroslav.<br/>Yer Numarası ONLINE<br/>Elektronik Erişim ScienceDirect <a href="http://www.sciencedirect.com/science/book/9780444895431">http://www.sciencedirect.com/science/book/9780444895431</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>