nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A very hard log-space counting class
|
Álvarez, Carme |
|
1993 |
107 |
1 |
p. 3-30 28 p. |
artikel |
2 |
Circuit size relative to pseudorandom oracles
|
Lutz, Jack H. |
|
1993 |
107 |
1 |
p. 95-120 26 p. |
artikel |
3 |
Contents EATCS bulletin number 48, October 1992
|
|
|
1993 |
107 |
1 |
p. 165-168 4 p. |
artikel |
4 |
Editorial Board
|
|
|
1993 |
107 |
1 |
p. ii- 1 p. |
artikel |
5 |
Extensions to Barrington's M-program model
|
Bédard, François |
|
1993 |
107 |
1 |
p. 31-61 31 p. |
artikel |
6 |
Foreword
|
Selman, Alan L. |
|
1993 |
107 |
1 |
p. 1- 1 p. |
artikel |
7 |
On read-once threshold formulae and their randomized decision tree complexity
|
Heiman, Rafi |
|
1993 |
107 |
1 |
p. 63-76 14 p. |
artikel |
8 |
On read once vs. multiple access to randomness in logspace
|
Nisan, Noam |
|
1993 |
107 |
1 |
p. 135-144 10 p. |
artikel |
9 |
Quantifiers and approximation
|
Panconesi, Alessandro |
|
1993 |
107 |
1 |
p. 145-163 19 p. |
artikel |
10 |
The computational complexity of universal hashing
|
Mansour, Yishay |
|
1993 |
107 |
1 |
p. 121-133 13 p. |
artikel |
11 |
Unambiguity of circuits
|
Lange, Klaus-Jörn |
|
1993 |
107 |
1 |
p. 77-94 18 p. |
artikel |