Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Laplante, Sophie - Laboratoire de Recherche en Informatique, Université de Paris-Sud 11
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
Habilitation `a diriger des recherches soutenue par
Universite de Montreal Le principe des bo^tes noires
THE UNIVERSITY OF CHICAGO KOLMOGOROV TECHNIQUES
Indistinguishability Sophie Laplante \Lambda
New Bounds for the Language Compression Problem H. Buhrman \Lambda S. Laplante y P. B. Miltersen z
Stronger separations for randomselfreducibility, rounds, and advice Laszlo Babai
Lower bounds using Kolmogorov complexity Sophie Laplante
Sophie Laplante LRI, Universit Paris-Sud Orsay
The quantum adversary method and classical formula size lower bounds
ResourceBounded Kolmogorov Complexity Revisited Harry Buhrman \Lambda
Quantum Kolmogorov Complexity Andr e Berthiaume
L'ordinateurq 30| LA RECHERCHE | JUIN 2006 | N 398
Sophie Laplante -LRI Frdric Magniez -CNRS LRI
