Zobrazeno 1 - 10
of 189
pro vyhledávání: '"Interactive proof systems"'
Autor:
Benzmüller, Christoph, Heule, Marijn J.H., Schmidt, Renate A.
Infotext (nur auf Basis des Vorgängers): This two-volume set of LNAI 14739-14740 constitute the proceedings of the 12th International Joint Conference on Automated Reasoning, IJCAR 2024, held in Nancy, France, during July 3-6, 2024. The 39 full rese
Externí odkaz:
https://library.oapen.org/handle/20.500.12657/92348
Autor:
Kristen Carlson
Publikováno v:
Philosophies, Vol 6, Iss 4, p 83 (2021)
Methods are currently lacking to prove artificial general intelligence (AGI) safety. An AGI ‘hard takeoff’ is possible, in which first generation AGI1 rapidly triggers a succession of more powerful AGIn that differ dramatically in their computati
Externí odkaz:
https://doaj.org/article/ba3cad24ebcb40acb664f740fcc11398
Autor:
Bogdanov, Andrej, Rosen, Alon
Most n-dimensional subspaces 𝒜 of ℝ^m are Ω(√m)-far from the Boolean cube {-1, 1}^m when n < cm for some constant c > 0. How hard is it to certify that the Nearest Boolean Vector (NBV) is at least γ √m far from a given random 𝒜? Certify
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ac167e9a00f7de522bc99d8f03442bb
Randomized algorithms and protocols assume the availability of a perfect source of randomness. In real life, however, perfect randomness is rare and is almost never guaranteed. The gap between these two facts motivated much of the work on randomness
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0b08a01d1916513be653354254e3711
Interactive proofs of proximity (IPPs) offer ultra-fast approximate verification of assertions regarding their input, where ultra-fast means that only a small portion of the input is read and approximate verification is analogous to the notion of app
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3be700c0f7b7b4ca2444f1799b381426
Publikováno v:
CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security
CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security, Nov 2022, Los Angeles CA USA, United States. pp.609-622, ⟨10.1145/3548606.3560628⟩
CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security, Nov 2022, Los Angeles CA USA, United States. pp.609-622, ⟨10.1145/3548606.3560628⟩
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0033c0dcdb574523894527c33d8e2ed
https://hal.science/hal-03860720
https://hal.science/hal-03860720
Autor:
Goldberg, Guy, N. Rothblum, Guy
Publikováno v:
13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Suppose we have random sampling access to a huge object, such as a graph or a database. Namely, we can observe the values of random locations in the object, say random records in the database or random edges in the graph. We cannot, however, query lo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d5fc9d13257f3bf3f5cc5d527ed96c7
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.
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.
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.
K zobrazení výsledku je třeba se přihlásit.