改进 $3N$$ 电路复杂度下限

{"title":"改进 $3N$$ 电路复杂度下限","authors":"Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov","doi":"10.1007/s00037-023-00246-9","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"62 ","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improving $$3N$$ Circuit Complexity Lower Bounds\",\"authors\":\"Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov\",\"doi\":\"10.1007/s00037-023-00246-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":51005,\"journal\":{\"name\":\"Computational Complexity\",\"volume\":\"62 \",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Complexity\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00037-023-00246-9\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Complexity","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00037-023-00246-9","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}