{"title":"寻找无限嵌套和和乘积表达式的最小深度的伸缩器","authors":"Carsten Schneider","doi":"10.1145/1073884.1073924","DOIUrl":null,"url":null,"abstract":"We provide algorithms that find, in case of existence, indefinite nested sum extensions in which a (creative) telescoping solution can be expressed with minimal nested depth.","PeriodicalId":311546,"journal":{"name":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"Finding telescopers with minimal depth for indefinite nested sum and product expressions\",\"authors\":\"Carsten Schneider\",\"doi\":\"10.1145/1073884.1073924\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We provide algorithms that find, in case of existence, indefinite nested sum extensions in which a (creative) telescoping solution can be expressed with minimal nested depth.\",\"PeriodicalId\":311546,\"journal\":{\"name\":\"Proceedings of the 2005 international symposium on Symbolic and algebraic computation\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2005 international symposium on Symbolic and algebraic computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1073884.1073924\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1073884.1073924","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finding telescopers with minimal depth for indefinite nested sum and product expressions
We provide algorithms that find, in case of existence, indefinite nested sum extensions in which a (creative) telescoping solution can be expressed with minimal nested depth.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
