Your search for 12479 returns 3217 document(s) |
Data Structure and Analysis of Algorithms : A Lower Bound on the Average-Case Complexity of Shellsort |
Author: T. Jiang, [et all] | Type: Indeks Artikel Jurnal
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Circuit complexity : from the worst case to the average case,hal 58-67 |
Author: Andreas Jakoby; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Fundamentals of the average case analysis of particular algorithms/Rainer Kemp |
Author: Kemp, Rainer; | Call Number: 519.4 Kem f | Type: Buku
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Data Structure and Analysis of Algorithms; The Soft Heap: An Approximate Priority Queue with Optimal Error Rate, A minimum Spanning Tree Algorithm with Inverse-Ackermann Type Complexity |
Author: B. Chazelle, [et all] | Type: Indeks Artikel Jurnal
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Competitive programming 3: the new lower bound of programming contests |
Author: Halim, Steven; | Call Number: 005.73 Hal c | Type: Buku
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Data Structure and Analysis of Algorithms: Speed Is as Powerful as Clairvoyance |
Author: B. Kalyanasundaram, [et all] | Type: Indeks Artikel Jurnal
|
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
|
A Lower bound theorem for indexing schemes and its application to multidimensional range queries, Hal. 44-51 |
Author: Vasilis Samoladas, Daniel P. Miranker; | Call Number: SEM-243 | Type: Indeks Artikel prosiding/Sem
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Data Structure and Analysis of Algorithms: The Geometric Maximum Traveling Salesman Problem |
Author: A. Barvinok, [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
|