{"title":"扩展多项式算法","authors":"A. C. Hearn, R. Loos","doi":"10.1145/800192.805696","DOIUrl":null,"url":null,"abstract":"It is shown that standard polynomial algorithms may be applied to a much wider class of functions by making a straightforward generalization of the concept of exponent. The implementation of a computer algebra system from a standard set of polynomial programs which allows for any coefficient or exponent structure is also discussed.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"35 1","pages":"147-152"},"PeriodicalIF":0.0000,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Extended polynomial algorithms\",\"authors\":\"A. C. Hearn, R. Loos\",\"doi\":\"10.1145/800192.805696\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that standard polynomial algorithms may be applied to a much wider class of functions by making a straightforward generalization of the concept of exponent. The implementation of a computer algebra system from a standard set of polynomial programs which allows for any coefficient or exponent structure is also discussed.\",\"PeriodicalId\":72321,\"journal\":{\"name\":\"ASSETS. Annual ACM Conference on Assistive Technologies\",\"volume\":\"35 1\",\"pages\":\"147-152\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1973-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ASSETS. Annual ACM Conference on Assistive Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800192.805696\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ASSETS. Annual ACM Conference on Assistive Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800192.805696","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
It is shown that standard polynomial algorithms may be applied to a much wider class of functions by making a straightforward generalization of the concept of exponent. The implementation of a computer algebra system from a standard set of polynomial programs which allows for any coefficient or exponent structure is also discussed.