{"title":"有限域上基于LU的特征多项式算法","authors":"Clément Pernet, Z. Wan","doi":"10.1145/990353.990367","DOIUrl":null,"url":null,"abstract":"Linear algebra computation over finite fields is important because many symbolic computation problems directly or indirectly rely on linear algebra using efficient finite fields representation.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"13 17","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"LU based algorithms for characteristic polynomial over a finite field\",\"authors\":\"Clément Pernet, Z. Wan\",\"doi\":\"10.1145/990353.990367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Linear algebra computation over finite fields is important because many symbolic computation problems directly or indirectly rely on linear algebra using efficient finite fields representation.\",\"PeriodicalId\":314801,\"journal\":{\"name\":\"SIGSAM Bull.\",\"volume\":\"13 17\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGSAM Bull.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/990353.990367\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGSAM Bull.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/990353.990367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
LU based algorithms for characteristic polynomial over a finite field
Linear algebra computation over finite fields is important because many symbolic computation problems directly or indirectly rely on linear algebra using efficient finite fields representation.