| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes
|
Cai, Jin-Yi
|
|
1999
|
69 |
4 |
p. 167-174
8 p.
|
artikel
|
| 2 |
Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones
|
Damm, Carsten
|
|
1999
|
69 |
4 |
p. 175-179
5 p.
|
artikel
|
| 3 |
Generating languages by a derivation procedure for elementary formal systems
|
Sugimoto, Noriko
|
|
1999
|
69 |
4 |
p. 161-166
6 p.
|
artikel
|
| 4 |
On detecting spatial regularity in noisy images
|
Robins, Gabriel
|
|
1999
|
69 |
4 |
p. 189-195
7 p.
|
artikel
|
| 5 |
Sparse sets, approximable sets, and parallel queries to NP
|
Arvind, V.
|
|
1999
|
69 |
4 |
p. 181-188
8 p.
|
artikel
|
| 6 |
Symbolic verification method for definite iteration over data structures
|
Nepomniaschy, V.A.
|
|
1999
|
69 |
4 |
p. 207-213
7 p.
|
artikel
|
| 7 |
Symmetric Min-Max heap: A simpler data structure for double-ended priority queue
|
Arvind, A.
|
|
1999
|
69 |
4 |
p. 197-199
3 p.
|
artikel
|
| 8 |
The graph clustering problem has a perfect zero-knowledge interactive proof
|
De Santis, Alfredo
|
|
1999
|
69 |
4 |
p. 201-206
6 p.
|
artikel
|
Tijdschrift beschrijving