按相关排序
全部格式
全部页数
时间不限
只看优质
只看可投资
展开
排序：
相关 最多阅读 最新上传
格式：
全部 doc pdf ppt xls txt 豆单
页数：
全部 1-8页 9-100页 100页以上
时间：
全部 2024年 2023年 2022年及以前
410
Arithmetical Properties of Commutative Rings and Monoids, Scott T. Chapman, ed. CRC, 2005.pdf
交换环和半群的算术性质，免费！
收藏到书房
41
Inside the Muchnik degrees II The degree structures induced by the arithmetical hierarchy of countably continuous functions.pdf
AppliedLogic 165 (2014) 1201–1241Contents lists available /locate/apalIn
收藏到书房
88
On the distribution of the values of arithmetical functions, PhD thesis, Mehdi Hassani, Institute for Advanced Studies in Basic Sciences, Zanjan, Iran & Universite de Bordeaux, France, Dece...pdf
4164TH`ESEpresentee`aL’UNIVERSITE BORDEAUX IECOLE DOCTORALE DE MATHEMATIQUES ET INFORMATIQUEpar Mehd
收藏到书房
103
some studies on arithmetical chaos in classical and quantum mechanics.pdf
some studies on arithmetical chaos in classical and quantum mechanics
收藏到书房
54
On some infinite series involving arithmetical functions (II).pdf
On some infinite series involving arithmetical functions (II)
收藏到书房
165
LOWER BOUND FRONTIERS IN ARITHMETICAL CIRCUIT COMPLEXITY.pdf
Given the inherent hardness in proving lower bounds for Boolean circuits, we embarked upon a study of arithmetical circuits. They bring the promise, more readily than Boolean circuits, of involving sophisticated concepts from algebra and algebraic geometry in a successful lower bound proof. We continued the investigation of -formulas started by Shpilka and Wigderson [SW99]. There we presented a new technique for proving lower bounds by introducing the notion of resistance of a polynomial. Using this notion we proved tight lower bounds, amongst others, on the sum of nth powers polynomial f = ni= xn. For any d, there are only n many dth order partial derivatives for this polynomial, which makes it hard to derive lower bounds using 1 i the partial derivatives technique from [SW99]. The partial derivatives technique yields lower bounds on multiplicative complexity only. In Chapter 3, we showed how this method can be extended to give lower bounds on total complexity, utilizing a closed
收藏到书房
52
Arithmetical identities of the Brauer-Rademacher type.pdf
Arithmetical identities of the Brauer-Rademacher type
收藏到书房
55
Old Babylonian Arithmetical Table Texts.pdf
Old Babylonian Arithmetical Table Texts
收藏到书房

向豆丁求助：有没有arithmetical?

如要投诉违规内容，请联系我们按需举报；如要提出意见建议，请到社区论坛发帖反馈。