Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Childs, Andrew M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Bose-Hubbard model is QMA-complete
Andrew M. Childs
,
David Gosset
,
Zak Webb
Lecture Notes in Computer Science
8572
, 2014, pp. 308-319
Time-efficient quantum walks for 3-distinctness
Aleksandrs Belovs
,
Andrew M. Childs
,
Stacey Jeffery
,
Robin Kothari
,
Frédéric Magniez
Lecture Notes in Computer Science
7965
, 2013, pp. 105-122
The quantum query complexity of read-many formulas
Andrew M. Childs
,
Shelby Kimmel
,
Robin Kothari
Lecture Notes in Computer Science
7501
, 2012, pp. 337-348
Quantum query complexity of minor-closed graph properties
Andrew M. Childs
,
Robin Kothari
SIAM Journal on Computing
41
(6), 2012, pp. 1426-1450
Quantum query complexity of minor-closed graph properties
Andrew M. Childs
,
Robin Kothari
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 661-672
Optimal quantum adversary lower bounds for ordered search
Andrew M. Childs
,
Troy Lee
Lecture Notes in Computer Science
5125
, 2008, pp. 869-880
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs
,
Richard Cleve
,
Enrico Deotto
,
Edward Farhi
,
Sam Gutmann
,
Daniel A. Spielman
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 59-68