LOWER BOUNDS AND FAST ALGORITHMS FOR SEQUENCE ACCELERATION

被引：1
|
作者：
TROJAN, GM
机构：
[1] Univ of Western Ontario, Dep of, Physics, London, Ont, Can, Univ of Western Ontario, Dep of Physics, London, Ont, Can
来源：
JOURNAL OF THE ACM | 1984年 / 31卷 / 02期
关键词：
D O I：
10.1145/62.66
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Tight upper and lower bounds are obtained for sequence accelerating. The lower bounds follow from a powerful asymptotic adversary principle. Algorithms are presented and shown to be almost optimal.
引用
收藏
页码：329 / 335
页数：7
相关论文
共 50 条
  • [1] On Fast Polynomial Algorithms and Lower Bounds of the Linear Complexity
    李磊
    数学季刊, 1996, (02) : 1 - 4
  • [2] Lower Bounds on Fast Searching
    Stanley, Donald
    Yang, Boting
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 964 - +
  • [3] DLP in semigroups: Algorithms and lower bounds
    Han, Jiao
    Zhuang, Jincheng
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2022, 16 (01) : 278 - 288
  • [4] Quantum query algorithms and lower bounds
    Ambainis, A
    Classical and New Paradigms of Computation and Their Complexity Hierarchies, 2004, 23 : 15 - 32
  • [5] Propositional lower bounds: Algorithms and complexity
    Cadoli, M
    Palopoli, L
    Scarcello, F
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1999, 27 (1-4) : 129 - 148
  • [6] Lower complexity bounds for interpolation algorithms
    Gimenez, Nardo
    Heintz, Joos
    Matera, Guillermo
    Solerno, Pablo
    JOURNAL OF COMPLEXITY, 2011, 27 (02) : 151 - 187
  • [7] Propositional lower bounds: Generalization and algorithms
    Cadoli, M
    Palopoli, L
    Scarcello, F
    LOGICS IN ARTIFICIAL INTELLIGENCE, 1998, 1489 : 355 - 367
  • [8] Lower bounds on generic algorithms in groups
    Maurer, U
    Wolf, S
    ADVANCES IN CRYPTOLOGY - EUROCRYPT '98, 1998, 1403 : 72 - 84
  • [9] LEARNING ALGORITHMS FROMCIRCUIT LOWER BOUNDS
    Pich, Jan
    COMPUTATIONAL COMPLEXITY, 2025, 34 (01)
  • [10] Propositional lower bounds: Algorithms and complexity
    Marco Cadoli
    Luigi Palopoli
    Francesco Scarcello
    Annals of Mathematics and Artificial Intelligence, 1999, 27 : 129 - 148
12345