{"title":"On complexity of searching for periods of functions given by polynomials over a prime field","authors":"S. Selezneva","doi":"10.33048/daio.2022.29.727","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":126663,"journal":{"name":"Diskretnyi analiz i issledovanie operatsii","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Diskretnyi analiz i issledovanie operatsii","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33048/daio.2022.29.727","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}