Running time predictions for factoring algorithms

被引：0
|
作者：
Croot, Ernie [1 ]
Granville, Andrew [2 ]
Pemantle, Robin [3 ]
Tetali, Prasad [1 ,4 ]
机构：
[1] Georgia Tech, Sch Math, Atlanta, GA 30332 USA
[2] Univ Montreal, Dept Math & Stat, Montreal, PQ H3C 3J7, Canada
[3] Univ Penn, Dept Math, Philadelphia, PA 19104 USA
[4] Georgia Technol, Sch Math, Coll Comp, Atlanta, GA 30332 USA
来源：
ALGORITHMIC NUMBER THEORY | 2008年 / 5011卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：1 / +
页数：3
相关论文
共 50 条
  • [1] ON THE DISTRIBUTION OF RUNNING TIMES OF CERTAIN INTEGER FACTORING ALGORITHMS
    HAFNER, JL
    MCCURLEY, KS
    JOURNAL OF ALGORITHMS, 1989, 10 (04) : 531 - 556
  • [2] Factoring integers by CVP algorithms
    Schnorr, C.P. (schnorr@cs.uni-frankfurt.de), 2013, Springer Verlag (8260 LNCS):
  • [3] EFFICIENCY OF ALGORITHMS FOR POLYNOMIAL FACTORING
    MOENCK, RT
    MATHEMATICS OF COMPUTATION, 1977, 31 (137) : 235 - 250
  • [4] Switch Analysis for Running Time Analysis of Evolutionary Algorithms
    Yu, Yang
    Qian, Chao
    Zhou, Zhi-Hua
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (06) : 777 - 792
  • [5] BOUNDING THE RUNNING TIME OF ALGORITHMS FOR SCHEDULING AND PACKING PROBLEMS
    Jansen, K.
    Land, F.
    Land, K.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (01) : 343 - 366
  • [6] Radiosity algorithms running in sub-quadratic time
    Szirmay-Kalos, L
    Foris, T
    WSCG '97: THE FIFTH INTERNATIONAL CONFERENCE IN CENTRAL EUROPE ON COMPUTER GRAPHICS AND VISUALIZATION '97, CONFERENCE PROCEEDINGS, VOL 1-4, 1997, : 552 - 561
  • [7] Empirical Comparisons of Online Boosting Algorithms with Running Time
    Sun, Xiaowei
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MATERIAL, MECHANICAL AND MANUFACTURING ENGINEERING, 2015, 27 : 804 - 807
  • [8] Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
    Gupta, Anupam
    Krishnaswamy, Ravishankar
    Nagarajan, Viswanath
    Ravi, R.
    MATHEMATICS OF OPERATIONS RESEARCH, 2015, 40 (01) : 56 - 79
  • [9] General Lower Bounds for the Running Time of Evolutionary Algorithms
    Sudholt, Dirk
    PARALLEL PROBLEMS SOLVING FROM NATURE - PPSN XI, PT I, 2010, 6238 : 124 - 133
  • [10] Old and new deterministic factoring algorithms
    McKee, J
    Pinch, R
    ALGORITHMIC NUMBER THEORY, 1996, 1122 : 217 - 224
12345