Zobrazeno 1 - 10
of 107
pro vyhledávání: '"Rosen, Alon"'
The planted random subgraph detection conjecture of Abram et al. (TCC 2023) asserts the pseudorandomness of a pair of graphs $(H, G)$, where $G$ is an Erdos-Renyi random graph on $n$ vertices, and $H$ is a random induced subgraph of $G$ on $k$ vertic
Externí odkaz:
http://arxiv.org/abs/2409.16227
Publikováno v:
In Proc. 14th ITCS, volume 251 of LIPIcs, pages 67:1-67:17, 2023
A problem is \emph{downward self-reducible} if it can be solved efficiently given an oracle that returns solutions for strictly smaller instances. In the decisional landscape, downward self-reducibility is well studied and it is known that all downwa
Externí odkaz:
http://arxiv.org/abs/2209.10509
Autor:
Bourneuf, Romain, Folwarczný, Lukáš, Hubáček, Pavel, Rosen, Alon, Schwartzbach, Nikolaj Ignatieff
Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on monochromatic subgraphs and the Erd\H{o}s-Rado sunflower lemma. Implicit v
Externí odkaz:
http://arxiv.org/abs/2209.04827
Autor:
Bitansky, Nir, Canetti, Ran, Cohn, Henry, Goldwasser, Shafi, Kalai, Yael Tauman, Paneth, Omer, Rosen, Alon
In this paper we show that the existence of general indistinguishability obfuscators conjectured in a few recent works implies, somewhat counterintuitively, strong impossibility results for virtual black box obfuscation. In particular, we show that i
Externí odkaz:
http://arxiv.org/abs/1401.0348
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationally-bounded players and the asymptotic nature of cryptographic security, a definitio
Externí odkaz:
http://arxiv.org/abs/1008.3123
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
Publikováno v:
Bourneuf, R, Folwarczný, L, Hubáček, P, Rosen, A & Schwartzbach, N I 2023, PPP-Completeness and Extremal Combinatorics . i 14th Conference on Innovations in Theoretical Computer Science . s. 1-20 . https://doi.org/10.4230/LIPIcs.ITCS.2023.22
Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey’s theorem on monochromatic subgraphs and the Erdős-Rado sunflower lemma. Implicit ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a53dae3ec07852141eaf0188ba94035
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.
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.
Autor:
Ball, Marshall, Boyle, Elette, Degwekar, Akshay, Deshpande, Apoorvaa, Rosen, Alon, Vaikuntanathan, Vinod, Vasudevan, Prashant Nalini
Reductions between problems, the mainstay of theoretical computer science, efficiently map an instance of one problem to an instance of another in such a way that solving the latter allows solving the former. The subject of this work is "lossy" reduc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cb6e04e450adc88cbc6ef6185614c10
https://hdl.handle.net/11565/4053349
https://hdl.handle.net/11565/4053349