| Your search for 37950 returns 1575 document(s) |
| 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
|
| 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 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
|
| 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
|
| Time bounds for mutual exclusion and related problems,Hal 224-232 |
|
Author: Jae-Heon Yang; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Parallel implementation of non linear evolution problems using parabolic domain decomposition, Hal. 379-384 |
|
Author: Amir Averbuch; Moshe Israeli; Lev Vosovoi; | Call Number: SEM-229 | Type: Indeks Artikel prosiding/Sem
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| And/or branch-and-bound for solving mixed integer linear programming problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 857 |
|
Author: Radu Marinescu; Rina Dechter; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
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
|
| 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
|
Search Result