FRINK Linked Data Fragments server

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

• W2932045673 abstract "Following the seminal work of [Williams, J. ACM 2014], in a recent breakthrough, [Murray and Williams, STOC 2018] proved that NQP (non-deterministic quasi-polynomial time) does not have polynomial-size ACC <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>0</sup> circuits. We strengthen the above lower bound to an average case one, by proving that for all constants c, there is a language in NQP, which is not 1/2+1/log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>c</sup> (n)-approximable by polynomial-size ACC <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>0</sup> circuits. In fact, our lower bound holds for a larger circuit class: 2(log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>a</sup> n)-size ACC <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>0</sup> circuits with a layer of threshold gates at the bottom (ACC ο THR circuits), for all constants a. Our work also improves the average-case lower bound for NEXP against polynomial-size ACC circuits by [Chen, Oliveira, and Santhanam, LATIN 2018]. Our new lower bound builds on several interesting components, including: : Barrington's theorem and the existence of an NC <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</sup> -complete language which is random self-reducible. : The sub-exponential witness-size lower bound for NE against ACC <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>0</sup> and the conditional non-deterministic PRG construction in [Williams, SICOMP 2016]. : An “almost'' almost-everywhere MA average-case lower bound (which strengthens the corresponding worst-case lower bound in [Murray and Williams, STOC 2018]). A PSPACE-complete language which is same-length checkable, error-correctable and also has some other nice reducibility properties, which builds on [Trevisan and Vadhan, Computational Complexity 2007]. Moreover, all its reducibility properties have corresponding low-depth non-adaptive oracle circuits. Like other lower bounds proved via the algorithmic approach'', the only property of ACC <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>0</sup> ο THR exploited by us is the existence of a non-trivial SAT algorithm for ACC <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>0</sup> ο THR [Williams, STOC 2014]. Therefore, for any typical circuit class ℓ, our results apply to them as well if the corresponding non-trivial SAT (in fact, GAP-UNSAT) algorithms are discovered." @default.
• W2932045673 created "2019-04-11" @default.
• W2932045673 creator A5005971604 @default.
• W2932045673 date "2019-11-01" @default.
• W2932045673 modified "2023-09-25" @default.
• W2932045673 title "Non-deterministic Quasi-Polynomial Time is Average-Case Hard for ACC Circuits" @default.
• W2932045673 cites W1509697755 @default.
• W2932045673 cites W1598233781 @default.
• W2932045673 cites W1901622511 @default.
• W2932045673 cites W1973874352 @default.
• W2932045673 cites W1984108045 @default.
• W2932045673 cites W1984477611 @default.
• W2932045673 cites W1989019709 @default.
• W2932045673 cites W1989076199 @default.
• W2932045673 cites W1993138363 @default.
• W2932045673 cites W1996834809 @default.
• W2932045673 cites W1998918799 @default.
• W2932045673 cites W2004130530 @default.
• W2932045673 cites W2009994177 @default.
• W2932045673 cites W2010873187 @default.
• W2932045673 cites W2019578639 @default.
• W2932045673 cites W2026339776 @default.
• W2932045673 cites W2027528470 @default.
• W2932045673 cites W2027665018 @default.
• W2932045673 cites W2036656440 @default.
• W2932045673 cites W2060270693 @default.
• W2932045673 cites W2070678975 @default.
• W2932045673 cites W2082647621 @default.
• W2932045673 cites W2083820240 @default.
• W2932045673 cites W2111824166 @default.
• W2932045673 cites W2134409170 @default.
• W2932045673 cites W2144345645 @default.
• W2932045673 cites W2148352980 @default.
• W2932045673 cites W2150795250 @default.
• W2932045673 cites W2158747250 @default.
• W2932045673 cites W2173078028 @default.
• W2932045673 cites W2293988196 @default.
• W2932045673 cites W2343516500 @default.
• W2932045673 cites W2566287849 @default.
• W2932045673 cites W2794128811 @default.
• W2932045673 cites W2799236954 @default.
• W2932045673 cites W2809266875 @default.
• W2932045673 cites W2899793533 @default.
• W2932045673 cites W2912080987 @default.
• W2932045673 cites W2952032520 @default.
• W2932045673 cites W2964024530 @default.
• W2932045673 cites W2964142086 @default.
• W2932045673 cites W3021570316 @default.
• W2932045673 cites W4212956348 @default.
• W2932045673 cites W4213042755 @default.
• W2932045673 cites W4240781210 @default.
• W2932045673 cites W4252948584 @default.
• W2932045673 cites W4298227433 @default.
• W2932045673 doi "https://doi.org/10.1109/focs.2019.00079" @default.
• W2932045673 hasPublicationYear "2019" @default.
• W2932045673 type Work @default.
• W2932045673 sameAs 2932045673 @default.
• W2932045673 citedByCount "16" @default.
• W2932045673 countsByYear W29320456732020 @default.
• W2932045673 countsByYear W29320456732021 @default.
• W2932045673 countsByYear W29320456732022 @default.
• W2932045673 countsByYear W29320456732023 @default.
• W2932045673 crossrefType "proceedings-article" @default.
• W2932045673 hasAuthorship W2932045673A5005971604 @default.
• W2932045673 hasConcept C114614502 @default.
• W2932045673 hasConcept C118615104 @default.
• W2932045673 hasConcept C134306372 @default.
• W2932045673 hasConcept C33923547 @default.
• W2932045673 hasConcept C41008148 @default.
• W2932045673 hasConcept C77553402 @default.
• W2932045673 hasConcept C90119067 @default.
• W2932045673 hasConceptScore W2932045673C114614502 @default.
• W2932045673 hasConceptScore W2932045673C118615104 @default.
• W2932045673 hasConceptScore W2932045673C134306372 @default.
• W2932045673 hasConceptScore W2932045673C33923547 @default.
• W2932045673 hasConceptScore W2932045673C41008148 @default.
• W2932045673 hasConceptScore W2932045673C77553402 @default.
• W2932045673 hasConceptScore W2932045673C90119067 @default.
• W2932045673 hasLocation W29320456731 @default.
• W2932045673 hasOpenAccess W2932045673 @default.
• W2932045673 hasPrimaryLocation W29320456731 @default.
• W2932045673 hasRelatedWork W2042269609 @default.
• W2932045673 hasRelatedWork W2043525791 @default.
• W2932045673 hasRelatedWork W2108149667 @default.
• W2932045673 hasRelatedWork W2156058221 @default.
• W2932045673 hasRelatedWork W2283239302 @default.
• W2932045673 hasRelatedWork W2743273005 @default.
• W2932045673 hasRelatedWork W2767623943 @default.
• W2932045673 hasRelatedWork W2963154509 @default.
• W2932045673 hasRelatedWork W2963726605 @default.
• W2932045673 hasRelatedWork W4297815966 @default.
• W2932045673 isParatext "false" @default.
• W2932045673 isRetracted "false" @default.
• W2932045673 magId "2932045673" @default.
• W2932045673 workType "article" @default.