发布求助
文献互助 智能选刊 最新文献

寻找无限嵌套和和乘积表达式的最小深度的伸缩器

Proceedings of the 2005 international symposium on Symbolic and algebraic computation Pub Date : 2005-07-24 DOI:10.1145/1073884.1073924
Carsten Schneider
{"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}
引用次数: 29

摘要

我们提供的算法，在存在的情况下，找到一个(创造性的)伸缩解可以用最小的嵌套深度表示的无限嵌套和扩展。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
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.
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信