| Your search for 12491 returns 1866 document(s) |
| 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
|
| 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
|
| Theory or computation formal languages, automata, and complexity |
|
Author: Brookshear, J. Glenn; | Call Number: 511 Bro t | Type: Buku
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Decisions, Uncertainty, and Computation: Complexity of Finite-Horizon Markov Decision Process Problems |
|
Author: M. Mundhenk, [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
|
| Formal Languages and Complexity Theory: On the Generating Sequences of Regular Languages on k Symbols |
|
Author: M. -P. Beal, [et all] | Type: Indeks Artikel Jurnal
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Formal Languages and Complexity Theory: The Expressibility of Languages and Relations by Word Equations |
|
Author: J. Karhumaki, [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
|
| Effecient zero-knowledge proofs for some practical graph problems, (LNCS-Lecture Notes in Computer Science 2576) Hal 290-302 |
|
Author: Yvo Desmedt; Yongge Wang; | Call Number: 005.8 Sec | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Search Result