nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A new universal and fault-tolerant quantum basis
|
Boykin, P.Oscar |
|
2000 |
75 |
3 |
p. 101-107 7 p. |
artikel |
2 |
A note on closure properties of logspace MOD classes
|
Hertrampf, Ulrich |
|
2000 |
75 |
3 |
p. 91-93 3 p. |
artikel |
3 |
Approximation algorithms for the TSP with sharpened triangle inequality
|
Böckenhauer, Hans-Joachim |
|
2000 |
75 |
3 |
p. 133-138 6 p. |
artikel |
4 |
Clique polynomials have a unique root of smallest modulus
|
Goldwurm, Massimiliano |
|
2000 |
75 |
3 |
p. 127-132 6 p. |
artikel |
5 |
Computational complexity of similarity retrieval in a pictorial database
|
Guan, D.J. |
|
2000 |
75 |
3 |
p. 113-117 5 p. |
artikel |
6 |
Covering a set of points by two axis-parallel boxes
|
Bespamyatnikh, Sergei |
|
2000 |
75 |
3 |
p. 95-100 6 p. |
artikel |
7 |
How rich is the structure of the intrinsic complexity of learning
|
Ambainis, Andris |
|
2000 |
75 |
3 |
p. 109-112 4 p. |
artikel |
8 |
On the computational power of linearly transformed BDDs
|
Günther, Wolfgang |
|
2000 |
75 |
3 |
p. 119-125 7 p. |
artikel |