Titlebook: Computer Science – Theory and Applications; 16th International C Rahul Santhanam,Daniil Musatov Conference proceedings 2021 Springer Nature

天空

Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata,y a streaming algorithm of similar complexity, and we identify two different aspects in which SCAs are more restricted than streaming algorithms. We also show there is a language which cannot be accepted by any SCA in . time, even though it admits an .-space streaming algorithm with . update time.

愚笨

并置

MODE

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233821.jpg

性滿(mǎn)足

The Chemistry of Metal AlkoxidesWe prove a complexity dichotomy theorem for a class of Holant problems on 3-regular bipartite graphs. Given an arbitrary nonnegative weighted symmetric constraint function ., we prove that the bipartite Holant problem . is . computable in polynomial time . #P-hard. The dichotomy criterion on . is explicit.

concert

https://doi.org/10.1007/b113856It is shown that there exists . in E. such that for every . matrix . of rank . we have ., whenever . for a sufficiently small ., and . is large enough. This generalizes recent results which bound below the probability by . or apply to constant-depth circuits.

Electrolysis

粗鄙的人

pericardium

無(wú)法取消

Upper Bound for Torus Polynomials,We prove that all functions that have low degree torus polynomials approximating them with small error also have . circuits computing them. This serves as a partial converse to the result that all . functions have low degree torus polynomials approximating them with small error, by Bhrushundi, Hosseini, Lovett and Rao (ITCS 2019).