On the Computational Complexity of Compressed Power Series

被引：0
|
作者：
Karatsuba, E. A. [1 ]
机构：
[1] Russian Acad Sci, Fed Res Ctr Comp Sci & Control, Moscow 119333, Russia
来源：
MATHEMATICAL NOTES | 2023年 / 114卷 / 1-2期
基金：
俄罗斯科学基金会;
关键词：
algorithm; power series; computational complexity; fast algorithm; FEE method; Faulhaber's formula; Bernoulli numbers; MULTIPLICATION;
D O I：
10.1134/S000143462307009X
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We present computational algorithms and complexity estimates for power series in which all exponents are positive integers raised to one and the same integer power >= 2.
引用
收藏
页码：92 / 98
页数：7
相关论文
共 50 条
  • [31] Low computational complexity simulation algorithm for power control in WCDMA system
    Xu, Wen-Jun
    Liu, De-Chang
    He, Zhi-Qiang
    Niu, Kai
    Wu, Wei-Ling
    Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2007, 30 (04): : 93 - 97
  • [32] On computational complexity of the electric power flow optimization problem in market environment
    Eremeev A.V.
    Journal of Applied and Industrial Mathematics, 2017, 11 (4) : 500 - 505
  • [33] Model Predictive Control in Power Electronics: Strategies to Reduce the Computational Complexity
    Karamanakos, Petros
    Geyer, Tobias
    Oikonomou, Nikolaos
    Kieferndorf, Frederick
    Manias, Stefanos
    39TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY (IECON 2013), 2013, : 5818 - 5823
  • [34] Analysis of Computational Complexity and Power Consumption in Cloud Based Heterogeneous RAN
    Ramakrishnan, S.
    Kar, Subrat
    Selvamuthu, Dharmaraja
    2018 TWENTY FOURTH NATIONAL CONFERENCE ON COMMUNICATIONS (NCC), 2018,
  • [35] ANALYSIS OF STABILITY OF AXIALLY COMPRESSED CYLINDRICAL SHELLS BY METHOD OF GENERALIZED POWER SERIES
    BUCKO, S
    BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES TECHNIQUES, 1967, 15 (04): : 303 - &
  • [36] COMPUTATIONAL COMPLEXITY AND EXISTENCE OF COMPLEXITY GAPS
    BORODIN, A
    JOURNAL OF THE ACM, 1972, 19 (01) : 158 - &
  • [37] From Query Complexity to Computational Complexity
    Dobzinski, Shahar
    Vondrak, Jan
    STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 1107 - 1116
  • [38] Natural complexity, computational complexity and depth
    Machta, J.
    CHAOS, 2011, 21 (03)
  • [39] On the Computational Power of Oblivious Robots: Forming a Series of Geometric Patterns
    Das, Shantanu
    Flocchini, Paola
    Santoro, Nicola
    Yamashita, Masafumi
    PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2010, : 267 - 276
  • [40] The computational complexity of QoS measures for orchestrationsThe computational complexity of QoS measures
    Joaquim Gabarro
    Sergio Leon-Gaixas
    Maria Serna
    Journal of Combinatorial Optimization, 2017, 34 : 1265 - 1301
12345