有限阿贝尔群元系统的计算复杂度

{"title":"有限阿贝尔群元系统的计算复杂度","authors":"V. V. Kochergin","doi":"10.3103/s0027132223040034","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":null,"pages":null},"PeriodicalIF":0.2000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Computation Complexity of the Systems of Finite Abelian Group Elements\",\"authors\":\"V. V. Kochergin\",\"doi\":\"10.3103/s0027132223040034\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":42963,\"journal\":{\"name\":\"Moscow University Mathematics Bulletin\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.2000,\"publicationDate\":\"2023-08-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/s0027132223040034\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow University Mathematics Bulletin","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3103/s0027132223040034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}