搜索结果: 1-2 共查到“函数论 complexity”相关记录2条 . 查询时间(0.156 秒)
Complexity of Creative Telescoping for Bivariate Rational Functions
Hermite reduction creative telescoping
2013/9/3
The long-term goal initiated in this work is to obtain fast algorithms and implementations for definite integration in Almkvist and Zeilberger’s framework of (differential) creative telescoping. Our c...
On the parity complexity measures of Boolean functions
Computational complexity Communication complexity Parity decision tree Log-Rank conjecture
2012/11/30
The parity decision tree model extends the decision tree model by allowing the computation of a parity function in one step. We prove that the deterministic parity decision tree complexity of any Bool...