Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Paul F. Christiano"'
Autor:
Scott Aaronson, Paul F. Christiano
Publikováno v:
Theory of Computing. 9:349-401
Forty years ago, Wiesner pointed out that quantum mechanics raises the striking possibility of money that cannot be counterfeited according to the laws of physics. We propose the first quantum money scheme that is (1) public-key, meaning that anyone
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::743e28665e5a72c72f40061aa9000c70
https://doi.org/10.4086/toc.2013.v009a009
https://doi.org/10.4086/toc.2013.v009a009
Publikováno v:
Logic, Rationality, and Interaction ISBN: 9783662485606
LORI
LORI
Game theory treats players as special: A description of a game contains a full, explicit enumeration of all players. This isn’t a realistic assumption for autonomous intelligent agents. In this paper, we propose a framework in which agents and thei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe0ecefa24cf5a962155f70c29571090
https://doi.org/10.1007/978-3-662-48561-3_34
https://doi.org/10.1007/978-3-662-48561-3_34
Autor:
Paul F. Christiano
Publikováno v:
STOC
In many online learning problems we are interested in predicting local information about some universe of items. For example, we may want to know whether two items are in the same cluster rather than computing an assignment of items to clusters; we m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03085b32298f904c65e070b87135ca38
https://doi.org/10.1145/2591796.2591880
https://doi.org/10.1145/2591796.2591880
Autor:
Scott Aaronson, Paul F. Christiano
Publikováno v:
MIT web domain
STOC
STOC
Forty years ago, Wiesner pointed out that quantum mechanics raises the striking possibility of money that cannot be counterfeited according to the laws of physics. We propose the first quantum money scheme that is (1) public-key—meaning that anyone
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86cddabee6835913adef75f84a218a60
http://hdl.handle.net/1721.1/72581
http://hdl.handle.net/1721.1/72581
Publikováno v:
STOC
arXiv
arXiv
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems. Each electrical flow is given by the solution of a system of linea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6052969c378d95b29c14f2fbbf8e89e
https://doi.org/10.1145/1993636.1993674
https://doi.org/10.1145/1993636.1993674
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642222993
WADS
WADS
We develop the first dynamic data structures that tolerate δ memory faults, lose no data, and incur only an O(δ) additive overhead in overall space and time per operation. We obtain such data structures for arrays, linked lists, binary search trees
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ff40f600df9abbec6fc0c9b40c0dfeb
https://doi.org/10.1007/978-3-642-22300-6_21
https://doi.org/10.1007/978-3-642-22300-6_21
Autor:
Paul F. Christiano, Brent E. Moats
Publikováno v:
SAE Technical Paper Series.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f58ce234c7dbfad4eb524b6865e725fc
https://doi.org/10.4271/942551
https://doi.org/10.4271/942551
Autor:
Paul F. Christiano
Publikováno v:
SAE Technical Paper Series.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de7a0138e812893b39907958a5ee1c93
https://doi.org/10.4271/860840
https://doi.org/10.4271/860840
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.