Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Theory of computation → Interactive proof systems"'
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
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
Autor:
Andronick, June, de Moura, Leonardo
LIPIcs, Volume 237, ITP 2022, Complete Volume
LIPIcs, Vol. 237, 13th International Conference on Interactive Theorem Proving (ITP 2022), pages 1-602
LIPIcs, Vol. 237, 13th International Conference on Interactive Theorem Proving (ITP 2022), pages 1-602
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3118e563421b6e25d07e581fd59952d
Autor:
Hirahara, S, Santhanam, R
We consider the question of whether errorless and error-prone notions of average-case hardness are equivalent, and make several contributions. First, we study this question in the context of hardness for NP, and connect it to the long-standing open q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13a53f41a63c60a4a06dc35ab5a0ef76
Autor:
Cook, Joshua
Let TISP[T, S], BPTISP[T, S], NTISP[T, S] and CoNTISP[T, S] be the set of languages recognized by deterministic, randomized, nondeterministic, and co-nondeterministic algorithms, respectively, running in time T and space S. Let ITIME[T_V, T_P] be the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fb4a5a3dae5a4598ca086a2b42f967d
Autor:
Dillies, Yaël, Mehta, Bhavik
Szemerédi’s Regularity Lemma is a fundamental result in graph theory with extensive applications to combinatorics and number theory. In essence, it says that all graphs can be approximated by well-behaved unions of random bipartite graphs. We pres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3799682997343999f20c449f99f5c951
Autor:
Pąk, Karol, Kaliszyk, Cezary
Publikováno v:
ITP 2022
The DPRM (Davis-Putnam-Robinson-Matiyasevich) theorem is the main step in the negative resolution of Hilbert’s 10th problem. Almost three decades of work on the problem have resulted in several equally surprising results. These include the existenc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29d278c93165c036b8e93e067530ab88
Self-testing is a fundamental feature of quantum mechanics that allows a classical verifier to force untrusted quantum devices to prepare certain states and perform certain measurements on them. The standard approach assumes at least two spatially se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b45253a3f3749846bc7da57d74e1a5ed