{"title":"Pseudo-random Sets in the Grassmann Graph Have Near-Perfect Expansion","authors":"","doi":"10.1145/3568031.3568036","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":377190,"journal":{"name":"Circuits, Packets, and Protocols","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Circuits, Packets, and Protocols","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3568031.3568036","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}