Robert Spalek
Robert Spalek
undisclosed
E-mail megerősítve itt: ucw.cz - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Any AND-OR Formula of Size N Can Be Evaluated in Time on a Quantum Computer
A Ambainis, AM Childs, BW Reichardt, R ©palek, S Zhang
SIAM Journal on Computing 39 (6), 2513-2530, 2010
207*2010
Negative weights make adversaries stronger
P Hoyer, T Lee, R Spalek
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
1762007
Quantum verification of matrix products
H Buhrman, R Spalek
arXiv preprint quant-ph/0409035, 2004
1492004
Quantum query complexity of state conversion
T Lee, R Mittal, BW Reichardt, R ©palek, M Szegedy
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 344-353, 2011
1282011
Span-program-based quantum algorithm for evaluating formulas
BW Reichardt, R Spalek
Proceedings of the fortieth annual ACM symposium on Theory of computing, 103-112, 2008
1212008
All quantum adversary methods are equivalent
R ©palek, M Szegedy
International Colloquium on Automata, Languages, and Programming, 1299-1311, 2005
1182005
Quantum and classical strong direct product theorems and optimal time-space tradeoffs
H Klauck, R ©palek, R De Wolf
SIAM Journal on Computing 36 (5), 1472-1493, 2007
982007
Quantum fan-out is powerful
P Høyer, R ©palek
Theory of computing 1 (1), 81-103, 2005
84*2005
A direct product theorem for discrepancy
T Lee, A Shraibman, R ©palek
2008 23rd Annual IEEE Conference on Computational Complexity, 71-80, 2008
822008
Lower bounds on quantum query complexity. EATCS Bulletin, 87: 78–103, October 2005
P Høyer, R ©palek
arXiv preprint quant-ph/0509153, 0
63
Quantum algorithms for matching and network flows
A Ambainis, R ©palek
Annual Symposium on Theoretical Aspects of Computer Science, 172-183, 2006
502006
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
A Ambainis, R ©palek, R de Wolf
Algorithmica 55 (3), 422-461, 2009
342009
Adversary lower bound for the k-sum problem
A Belovs, R Spalek
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
322013
The multiplicative quantum adversary
R ©palek
2008 23rd Annual IEEE Conference on Computational Complexity, 237-248, 2008
252008
A dual polynomial for OR
R Spalek
arXiv preprint arXiv:0803.4516, 2008
252008
Space complexity of quantum computation
R ©palek, R ©palek
quantum 35 (37), 53, 2001
72001
Quantum algorithms, lower bounds, and time-space tradeoffs
R Spalek
AmsterdamILLC, 2006
52006
Quantum circuits with unbounded fan-out
R Spalek
32002
Adversary lower bound for the orthogonal array problem
R Spalek
arXiv preprint arXiv:1304.0845, 2013
22013
Every NAND formula on N variables can be evaluated in time
AM Childs, BW Reichardt, R ©palek, S Zhang
arXiv preprint quant-ph/0703015, 0
1
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20