Centrum Wiskunde & Informatica

On polynomial time bounded symmetry of information Article

Theoretical Computer Science, 345(2-3), 386-405.

T. J. Lee (Troy) and A. Romashchenko

January 2005
Bounded-depth Circuits: SeparatingWires from Gates In Proceedings

M. Koucký (Michal), P. Pudlak and D. Therien

January 2005
From Balls and Bins to Points and Vertices In Proceedings

R. Klasing, Z. Lotker (Zvi), A. Navarra and S. Perennes

January 2005
Lower Bounds on Quantum Query Complexity Article

Bulletin of the EATCS, 78-103.

P. Høyer (Peter) and R. Spalek (Robert)

January 2005
Quantum Fanout is Powerful Article

Theory of Computing, 1(5), 83-101.

P. Høyer (Peter) and R. Spalek (Robert)

January 2005
The quantum adversary method and classical formula size lower bounds Article

Complexity, 76-90.

S. Laplante, T. J. Lee (Troy) and M. Szegedy (Mario)

January 2005
Advances in Minimum Description Length: Theory and Applications Book

January 2005
Asymptotic log-loss of prequential maximum likelihood codes In Proceedings

P.D. Grünwald (Peter) and S. de Rooij (Steven)

January 2005

Previous

Next