{"title":"Lower Bound of Circuit Complexity of Parity Function in a Basis of Unbounded Fan-In","authors":"Yu. A. Kombarov","doi":"10.3103/S002713222106005X","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":"76 1","pages":"266 - 270"},"PeriodicalIF":0.2000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow University Mathematics Bulletin","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3103/S002713222106005X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
期刊介绍：
Moscow University Mathematics Bulletin is the journal of scientific publications reflecting the most important areas of mathematical studies at Lomonosov Moscow State University. The journal covers research in theory of functions, functional analysis, algebra, geometry, topology, ordinary and partial differential equations, probability theory, stochastic processes, mathematical statistics, optimal control, number theory, mathematical logic, theory of algorithms, discrete mathematics and computational mathematics.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
