Zobrazeno 1 - 10 of 19 pro vyhledávání: '"Roei Tell"'
2
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds
Autor: Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
Publikováno v: Journal of the ACM.
The Exponential-Time Hypothesis ( \(\mathtt {ETH} \) ) is a strengthening of the \(\mathcal {P} \ne \mathcal {NP} \) conjecture, stating that \(3\text{-}\mathtt {SAT} \) on n variables cannot be solved in (uniform) time 2 ϵ · n , for some ϵ > 0. I
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5ebce3fa9ed3dc54450c02756fa838ec
https://doi.org/10.1145/3593581
Zobrazit plný text záznamu
7
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials
Autor: Roei Tell
Publikováno v: computational complexity. 28:259-343
This work studies the question of quantified derandomization, which was introduced by Goldreich and Wigderson (STOC 2014). The generic quantified derandomization problem is the following: For a circuit class $${\mathcal{C}}$$ and a parameter B=B(n),
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e836723daa688499dbb501711dcaa608
https://doi.org/10.1007/s00037-019-00179-2
Zobrazit plný text záznamu
8
Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost
Autor: Lijie Chen, Roei Tell
Publikováno v: STOC
Extending the classical “hardness-to-randomness” line-of-works, Doron, Moshkovitz, Oh, and Zuckerman (FOCS 2020) recently proved that derandomization with near-quadratic time overhead is possible, under the assumption that there exists a function
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::80210db0befa2f7e9c6e6f50e7e8f592
https://doi.org/10.1145/3406325.3451059
Zobrazit plný text záznamu
9
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract
Autor: Ron D. Rothblum, Roei Tell, Eylon Yogev, Lijie Chen
Publikováno v: FOCS
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
The Exponential-Time Hypothesis (ETH) is a strengthening of the $\mathcal{P}\neq \mathcal{NP}$ conjecture, stating that 3-SAT on $n$ variables cannot be solved in (uniform) time $2^{\epsilon\cdot n}$ , for some $\epsilon > 0$ . In recent years, analo
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd7c75e6a301e9ffed6f96713aab5dde
https://doi.org/10.1109/focs46700.2020.00010
Zobrazit plný text záznamu
10
On Hitting-Set Generators for Polynomials That Vanish Rarely
Autor: Dean Doron, Amnon Ta-Shma, Roei Tell
The problem of constructing hitting-set generators for polynomials of low degree is fundamental in complexity theory and has numerous well-known applications. We study the following question, which is a relaxation of this problem: Is it easier to con
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebd250091fc067b91812aeb9698aa64a
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje