FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3126402506> ?p ?o ?g. }

• W3126402506 abstract "The Exponential-Time Hypothesis (ETH) is a strengthening of the P ≠ NP conjecture, stating that 3-SAT on n variables cannot be solved in (uniform) time 2 <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>ε·n</sup> , for some . In recent years, analogous hypotheses that are “exponentially-strong” forms of other classical complexity conjectures (such as NP ⊄ eq BPP or coNP ⊄ eq NP) have also been introduced, and have become widely influential. In this work, we focus on the interaction of exponential-time hypotheses with the fundamental and closely-related questions of derandomization and circuit lower bounds. We show that even relatively-mild variants of exponential-time hypotheses have far-reaching implications to derandomization, circuit lower bounds, and the connections between the two. Specifically, we prove that: 1) The Randomized Exponential-Time Hypothesis (rETH) implies that BPP can be simulated on “average-case” in deterministic (nearly-)polynomial-time (i.e., in time 2 <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>~O(log(n))</sup> =n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>loglog(n)O(1)</sup> ). The derandomization relies on a conditional construction of a pseudorandom generator with near-exponential stretch (i.e., with seed length ~O(log(n))); this significantly improves the state-of-the-art in uniform “hardness-to-randomness” results, which previously only yielded pseudorandom generators with sub-exponential stretch from such hypotheses. 2) The Non-Deterministic Exponential-Time Hypothesis (NETH) implies that derandomization of BPP is completely equivalent to circuit lower bounds against E, and in particular that pseudorandom generators are necessary for derandomization. In fact, we show that the foregoing equivalence follows from a very weak version of NETH, and we also show that this very weak version is necessary to prove a slightly stronger conclusion that we deduce from it. Lastly, we show that disproving certain exponential-time hypotheses requires proving breakthrough circuit lower bounds. In particular, if CireuitSAT for circuits over n bits of size poly(n) can be solved by probabilistic algorithms in time 2 <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n/polylog(n)</sup> , then BPε does not have circuits of quasilinear size." @default.
• W3126402506 created "2021-02-15" @default.
• W3126402506 creator A5000692668 @default.
• W3126402506 creator A5005971604 @default.
• W3126402506 creator A5048056525 @default.
• W3126402506 creator A5049757682 @default.
• W3126402506 date "2020-11-01" @default.
• W3126402506 modified "2023-09-26" @default.
• W3126402506 title "On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract" @default.
• W3126402506 cites W1593916827 @default.
• W3126402506 cites W1850905020 @default.
• W3126402506 cites W1966541996 @default.
• W3126402506 cites W1973874352 @default.
• W3126402506 cites W1985572324 @default.
• W3126402506 cites W1989076199 @default.
• W3126402506 cites W1995725694 @default.
• W3126402506 cites W1998918799 @default.
• W3126402506 cites W2004130530 @default.
• W3126402506 cites W2007327671 @default.
• W3126402506 cites W2021372200 @default.
• W3126402506 cites W2021736779 @default.
• W3126402506 cites W2027221236 @default.
• W3126402506 cites W2027528470 @default.
• W3126402506 cites W2082571280 @default.
• W3126402506 cites W2082647621 @default.
• W3126402506 cites W2086323611 @default.
• W3126402506 cites W2091641588 @default.
• W3126402506 cites W2092429268 @default.
• W3126402506 cites W2095531897 @default.
• W3126402506 cites W2107771176 @default.
• W3126402506 cites W2132833941 @default.
• W3126402506 cites W2158747250 @default.
• W3126402506 cites W2247361196 @default.
• W3126402506 cites W2293988196 @default.
• W3126402506 cites W2294619171 @default.
• W3126402506 cites W2809266875 @default.
• W3126402506 cites W2932045673 @default.
• W3126402506 cites W2969853629 @default.
• W3126402506 cites W2998808137 @default.
• W3126402506 cites W3165549676 @default.
• W3126402506 cites W4212956348 @default.
• W3126402506 doi "https://doi.org/10.1109/focs46700.2020.00010" @default.
• W3126402506 hasPublicationYear "2020" @default.
• W3126402506 type Work @default.
• W3126402506 sameAs 3126402506 @default.
• W3126402506 citedByCount "1" @default.
• W3126402506 countsByYear W31264025062023 @default.
• W3126402506 crossrefType "proceedings-article" @default.
• W3126402506 hasAuthorship W3126402506A5000692668 @default.
• W3126402506 hasAuthorship W3126402506A5005971604 @default.
• W3126402506 hasAuthorship W3126402506A5048056525 @default.
• W3126402506 hasAuthorship W3126402506A5049757682 @default.
• W3126402506 hasConcept C105795698 @default.
• W3126402506 hasConcept C11413529 @default.
• W3126402506 hasConcept C114614502 @default.
• W3126402506 hasConcept C118615104 @default.
• W3126402506 hasConcept C125112378 @default.
• W3126402506 hasConcept C134306372 @default.
• W3126402506 hasConcept C140642157 @default.
• W3126402506 hasConcept C151376022 @default.
• W3126402506 hasConcept C19086982 @default.
• W3126402506 hasConcept C2780990831 @default.
• W3126402506 hasConcept C311688 @default.
• W3126402506 hasConcept C33923547 @default.
• W3126402506 hasConcept C75235859 @default.
• W3126402506 hasConcept C77553402 @default.
• W3126402506 hasConcept C92913381 @default.
• W3126402506 hasConceptScore W3126402506C105795698 @default.
• W3126402506 hasConceptScore W3126402506C11413529 @default.
• W3126402506 hasConceptScore W3126402506C114614502 @default.
• W3126402506 hasConceptScore W3126402506C118615104 @default.
• W3126402506 hasConceptScore W3126402506C125112378 @default.
• W3126402506 hasConceptScore W3126402506C134306372 @default.
• W3126402506 hasConceptScore W3126402506C140642157 @default.
• W3126402506 hasConceptScore W3126402506C151376022 @default.
• W3126402506 hasConceptScore W3126402506C19086982 @default.
• W3126402506 hasConceptScore W3126402506C2780990831 @default.
• W3126402506 hasConceptScore W3126402506C311688 @default.
• W3126402506 hasConceptScore W3126402506C33923547 @default.
• W3126402506 hasConceptScore W3126402506C75235859 @default.
• W3126402506 hasConceptScore W3126402506C77553402 @default.
• W3126402506 hasConceptScore W3126402506C92913381 @default.
• W3126402506 hasFunder F4320306076 @default.
• W3126402506 hasFunder F4320313643 @default.
• W3126402506 hasFunder F4320338335 @default.
• W3126402506 hasLocation W31264025061 @default.
• W3126402506 hasOpenAccess W3126402506 @default.
• W3126402506 hasPrimaryLocation W31264025061 @default.
• W3126402506 hasRelatedWork W1525673003 @default.
• W3126402506 hasRelatedWork W2035665354 @default.
• W3126402506 hasRelatedWork W2117362057 @default.
• W3126402506 hasRelatedWork W2135453633 @default.
• W3126402506 hasRelatedWork W2152662275 @default.
• W3126402506 hasRelatedWork W2783162249 @default.
• W3126402506 hasRelatedWork W2978186572 @default.
• W3126402506 hasRelatedWork W3126402506 @default.
• W3126402506 hasRelatedWork W2499643107 @default.
• W3126402506 hasRelatedWork W2505660553 @default.
• W3126402506 isParatext "false" @default.
• W3126402506 isRetracted "false" @default.

• next