Výsledky vyhledávání

Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks

Autor: Buhrman, H., Loff, B., Patro, S., Speelman, F., Braverman, M.

Publikováno v: 13th Innovations in Theoretical Computer Science Conference: ITCS 2022, January 31-February 3, 2022, Berkeley, CA, USA
13th Innovations in Theoretical Computer Science Conference

Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n³)-time or O(n²)-time classic algorithm can be solved by a known O(n^{1.5})-time or O(n)-time quantum algorithm. The question naturally arises

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2290536183adf736d4f84d8e2099350d
https://dare.uva.nl/personal/pure/en/publications/limits-of-quantum-speedups-for-computational-geometry-and-other-problems(0ee3640f-19cb-485f-a6a0-8c1d83c4b494).html

Zobrazit plný text záznamu

Memory Compression with Quantum Random-Access Gates

Autor: Buhrman, H., Loff, B., Patro, S., Speelman, F., Le Gall, F., Morimae, T.

Publikováno v: 17th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2022, July 11–15, 2022, Urbana Champaign, Illinois, USA
17th Conference on the Theory of Quantum Computation, Communication and Cryptography

In the classical RAM, we have the following useful property. If we have an algorithm that uses M memory cells throughout its execution, and in addition is sparse, in the sense that, at any point in time, only m out of M cells will be non-zero, then w

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46701301f0e5fd4f3a8895fd5fbb3fc9

Zobrazit plný text záznamu

Akademický článek

Nursing in asylum seeker detention in Australia: care, rights and witnessing

Autor: Zion, D, Briskman, L, Loff, B

Publikováno v: Journal of Medical Ethics, 2009 Sep 01. 35(9), 546-551.

Externí odkaz: https://www.jstor.org/stable/20696637

Zobrazit plný text záznamu

Akademický článek

Australian Resources for Ethical Participatory Processes in Public Health Research

Autor: Fry, C. L., Madden, A., Brogan, D., Loff, B.

Publikováno v: Journal of Medical Ethics, 2006 Mar 01. 32(3), 186-186.

Externí odkaz: https://www.jstor.org/stable/27719597

Zobrazit plný text záznamu

Catalytic space: non-determinism and hierarchy

Autor: Buhrman, H., Koucký, M., Loff, B., Speelman, F., Ollinger, N., Vollmer, H.

Publikováno v: Theory of Computing Systems, 62(1), 116-135. Springer New York
33rd Symposium on Theoretical Aspects of Computer Science: STACS'16, February 17-20, 2016, Orléans, France
33rd Symposium on Theoretical Aspects of Computer Science

Catalytic computation, defined by Buhrman, Cleve, Koucký, Loff and Speelman (STOC 2014), is a space-bounded computation where in addition to our working memory we have an exponentially larger auxiliary memory which is full; the auxiliary memory may

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c797a80db4cc40c2541abf89fbfbf33
https://doi.org/10.4230/lipics.stacs.2016.24

Zobrazit plný text záznamu

Reductions to the set of random strings: The resource-bounded case

Autor: Allender, E., Buhrman, H., Friedman, L., Loff, B., Rovan, B., Sassone, V., Widmayer, P.

Publikováno v: Logical Methods in Computer Science
Logical Methods in Computer Science, 10(3):5. Technischen Universitat Braunschweig
Mathematical Foundations of Computer Science 2012 ISBN: 9783642325885
MFCS
Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012 : proceedings, 88-99
STARTPAGE=88;ENDPAGE=99;TITLE=Mathematical Foundations of Computer Science 2012

This paper is motivated by a conjecture that BPP can be characterized in terms of polynomial-time nonadaptive reductions to the set of Kolmogorov-random strings. In this paper we show that an approach laid out in [Allender et al] to settle this conje

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4153f6dae2219ade7635e48d16ff2fc8
https://ir.cwi.nl/pub/22922

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Conference

Derandomizing from Random Strings.

Autor: Buhrman, H., Fortnow, L., Koucky?, M., Loff, B.

Publikováno v: 2010 IEEE 25th Annual Conference on Computational Complexity (CCC); 2010, p58-63, 6p

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání