Your search for 55429 returns 564 document(s) |
Bandwidth-Based Lower Bounds on Slowdown for Efficient Emulations of Fixed-Connection Networks |
Author: Clyde P. Kruskal, Kevin J. Rappoport; | Call Number: SEM-212 | Type: Indeks Artikel prosiding/Sem
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Computational Complexity: Quantum Lower Bounds for The Collision and the Element Distinctness Problems |
Author: S. Aaronson, [et all] | Type: Indeks Artikel Jurnal
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Lower bounds for parallel linear programming and other problems,Hal 603-614 |
Author: Ketan Mulmuley; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Lower bounds on testing membership to a polyhedron by algebraic decision trees,Hal 635-644 |
Author: Dima Grigoriev; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Bounds on the Greedy Routing Algorithm for Array Networks |
Author: Michael Mitzenmacher; | Call Number: SEM-212 | Type: Indeks Artikel prosiding/Sem
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Lower bounds for union-split-find related problems on random access machines,Hal 625-634 |
Author: Peter Bro Miltersen; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Formal Languages and Complexity Theory: Time-Space Trade-Off Lower Bounds for Randomized Computation of Decision Problems, A Complete Problem for Statistical Zero Knowledge |
Author: P. Beame, [et all] | Type: Indeks Artikel Jurnal
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Exploiting unit propagation to compute lower bounds in branch and bound max-sat solvers, (LNCS-Lecture Notes in Computer Science 3709) Hal 403-414 |
Author: Chu Min Li; Felip Manya; Jordi Planes; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Efficient routing in all-optical networks,hal 134-143 |
Author: Prabhakar Raghavan; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
|
Find Similar |
Add To Favorites |
Detail in New Window
|
A Computationally-efficient construction for the matrix-based key distribution in sensor networks, (LNCS-Lecture Notes in Computer Science 5576) Hal. 190-199 |
Author: Abeldelaziz Mohaisen; Nam-Su Jho; Dowon Hong; | Call Number: 005.8 Adv | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|