Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Falk Unger"'
Publikováno v:
Algorithmica, 81, 179-200
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are set
Autor:
Falk Unger
Publikováno v:
IEEE Transactions on Information Theory, 54(8), 3693-3698. Institute of Electrical and Electronics Engineers Inc.
IEEE Transactions on Information Theory, 54(8), 3693-3698
IEEE Transactions on Information Theory, 54(8), 3693-3698
It is known that $\epsilon$-noisy gates with 2 inputs are universal for arbitrary computation (i.e.\ can compute any function with bounded error), if all gates fail independently with probability $\epsilon$ and $\epsilon
Publikováno v:
Computational Complexity, 17(2), 282-299. Birkhauser Verlag Basel
Computational Complexity, 17(2), 282-299
IEEE Conference on Computational Complexity
Computational Complexity, 17(2), 282-299
IEEE Conference on Computational Complexity
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier's verdict is a function of the XOR of the two bits received. We show that, when the provers are allowed to coordinate
Publikováno v:
IEEE Concurrency. 5:64-72
The Sempa project brings together researchers from computer science, mechanical engineering, and numerical analysis to define software-engineering methods for the parallelization of existing large-scale software packages in scientific computing. The
Publikováno v:
FOCS
We study the problem of simulating protocols in a quantum communication setting over noisy channels. This problem falls at the intersection of quantum information theory and quantum communication complexity, and it will be of importance for eventual
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::058883b692cbc731853c9564815e4fdd
Publikováno v:
Nature. 496(7446)
Quantum computation and cryptography both involve scenarios in which a user interacts with an imperfectly modelled or ‘untrusted’ system. It is therefore of fundamental and practical interest to devise tests that reveal whether the system is beha
Publikováno v:
ITCS
Can a classical system command a general adversarial quantum system to realize arbitrary quantum dynamics? If so, then we could realize the dream of device-independent quantum cryptography: using untrusted quantum devices to establish a shared random
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e931be03c69b31f3f1e856c3252f86ab
Autor:
Falk Unger
Publikováno v:
FOCS
We prove a simple concentration inequality, which is an extension of the Chernoff bound and Hoeffding's inequality for binary random variables. Instead of assuming independence of the variables we use a slightly weaker condition, namely bounds on the
Autor:
Falk Unger, Lasse Leskelä
This paper studies a spatial queueing system on a circle, polled at random locations by a myopic server that can only observe customers in a bounded neighborhood. The server operates according to a greedy policy, always serving the nearest customer i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80eabbfb41614bb957b03f3435e9cbb7
http://arxiv.org/abs/0908.4585
http://arxiv.org/abs/0908.4585
Autor:
Falk Unger
Publikováno v:
ISIT
Evans and Pippenger showed in 1998 that noisy gates with 2 inputs are universal for arbitrary computation (i.e. can compute any function with bounded error), if all gates fail independently with probability epsilon and epsilon
Comment: Internati
Comment: Internati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87c8a8f3fddf197a9025d7e7537622a9
https://ir.cwi.nl/pub/12101
https://ir.cwi.nl/pub/12101