Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Ilango, Rahul"'
Computational differential privacy (CDP) is a natural relaxation of the standard notion of (statistical) differential privacy (SDP) proposed by Beimel, Nissim, and Omri (CRYPTO 2008) and Mironov, Pandey, Reingold, and Vadhan (CRYPTO 2009). In contras
Externí odkaz:
http://arxiv.org/abs/2301.00104
Publikováno v:
Electronic Journal of Combinatorics 25(4), 2018, 1-35
The jeu-de-taquin-based Littlewood-Richardson rule of H. Thomas and A. Yong (2009) for minuscule varieties has been extended in two orthogonal directions, either enriching the cohomology theory or else expanding the family of varieties considered. In
Externí odkaz:
http://arxiv.org/abs/1805.02287
Computational differential privacy (CDP) is a natural relaxation of the standard notion of (statistical) differential privacy (SDP) proposed by Beimel, Nissim, and Omri (CRYPTO 2008) and Mironov, Pandey, Reingold, and Vadhan (CRYPTO 2009). In contras
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd48966806df2aa0ab5f10ed01e75b7e
Autor:
Allender, Eric1 (AUTHOR) allender@cs.rutgers.edu, Ilango, Rahul2 (AUTHOR), Vafa, Neekon3,4 (AUTHOR)
Publikováno v:
Theory of Computing Systems. Apr2021, Vol. 65 Issue 3, p559-578. 20p.
How difficult is it to compute the communication complexity of a two-argument total Boolean function f:[N]×[N] → {0,1}, when it is given as an N×N binary matrix? In 2009, Kushilevitz and Weinreb showed that this problem is cryptographically hard,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20f8a31ba8a8aea764bb1e4c8aae6fd1
Autor:
Ilango, Rahul
The Minimum Circuit Size Problem (MCSP) asks whether a given Boolean function has a circuit of at most a given size. MCSP has been studied for over a half-century and has deep connections throughout theoretical computer science including to cryptogra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::584b61192f3840638fb7dcca77bf968a
Autor:
Ilango, Rahul
A longstanding open question is whether there is an equivalence between the computational task of determining the minimum size of any circuit computing a given function and the task of producing a minimum-sized circuit for a given function. While it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::340a44f222d151789b02f7e34d6b65fc
Can we design efficient algorithms for finding fast algorithms? This question is captured by various circuit minimization problems, and algorithms for the corresponding tasks have significant practical applications. Following the work of Cook and Lev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11796b029a46f05d3ba1b4bd0e612fbc
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:
Golovnev, Alexander, Ilango, Rahul, Impagliazzo, Russell, Kabanets, Valentine, Kolokolova, Antonina, Tal, Avishay
Minimum Circuit Size Problem (MCSP) asks to decide if a given truth table of an n-variate boolean function has circuit complexity less than a given parameter s. We prove that MCSP is hard for constant-depth circuits with mod p gates, for any prime p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb84aac3468958ca26037ae0246ba17a