nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A taxonomy of complexity classes of functions
|
Selman, Alan L. |
|
1994 |
48 |
2 |
p. 357-381 25 p. |
artikel |
2 |
Combinatorial techniques for universal hashing
|
Stinson, D.R. |
|
1994 |
48 |
2 |
p. 337-346 10 p. |
artikel |
3 |
Exact lower time bounds for computing Boolean functions on CREW PRAMs
|
Dietzfelbinger, Martin |
|
1994 |
48 |
2 |
p. 231-254 24 p. |
artikel |
4 |
Finding level-ancestors in trees
|
Berkman, Omer |
|
1994 |
48 |
2 |
p. 214-230 17 p. |
artikel |
5 |
Learning fixed point patterns by recurrent networks
|
Li, Leong Kwan |
|
1994 |
48 |
2 |
p. 203-213 11 p. |
artikel |
6 |
Nonuniform learnability
|
Benedek, Gyora M. |
|
1994 |
48 |
2 |
p. 311-323 13 p. |
artikel |
7 |
On reductions of NP sets to sparse sets
|
Homer, Steven |
|
1994 |
48 |
2 |
p. 324-336 13 p. |
artikel |
8 |
On the perceptron learning algorithm on data with high precision
|
Siu, Kai-Yeung |
|
1994 |
48 |
2 |
p. 347-356 10 p. |
artikel |
9 |
The complexity of propositional closed world reasoning and circumscription
|
Cadoli, Marco |
|
1994 |
48 |
2 |
p. 255-310 56 p. |
artikel |