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 条
  • [21] Predict task running time in grid environments based on CPU load predictions
    Zhang, Yuanyuan
    Sun, Wei
    Inoguchib, Yasushi
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2008, 24 (06): : 489 - 497
  • [22] Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
    May, Alexander
    Ritzenhofen, Maike
    PUBLIC KEY CRYPTOGRAPHY-PKC 2009, PROCEEDINGS, 2009, 5443 : 1 - 14
  • [23] A simple expected running time analysis for randomized "divide and conquer" algorithms
    Dean, BC
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (01) : 1 - 5
  • [24] Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
    Alekhnovich, Michael
    Hirsch, Edward A.
    Itsykson, Dmitry
    JOURNAL OF AUTOMATED REASONING, 2005, 35 (1-3) : 51 - 72
  • [25] Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
    Laumanns M.
    Thiele M.
    Zitzler E.
    Natural Computing, 2004, 3 (1) : 37 - 51
  • [26] Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
    Michael Alekhnovich
    Edward A. Hirsch
    Dmitry Itsykson
    Journal of Automated Reasoning, 2005, 35 : 51 - 72
  • [27] RUNNING TIME EXPERIMENTS ON SOME ALGORITHMS FOR SOLVING PROPOSITIONAL SATISFIABILITY PROBLEMS
    MAYER, J
    MITTERREITER, I
    RADERMACHER, FJ
    ANNALS OF OPERATIONS RESEARCH, 1995, 55 : 139 - 178
  • [28] Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
    Alekhnovich, M
    Hirsch, EA
    Itsykson, D
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 84 - 96
  • [29] Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
    Alekhnovich, M. (misha@ias.edu), 1600, Kluwer Academic Publishers (35): : 1 - 3
  • [30] An Experimental Method to Estimate Running Time of Evolutionary Algorithms for Continuous Optimization
    Huang, Han
    Su, Junpeng
    Zhang, Yushan
    Hao, Zhifeng
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (02) : 275 - 289
12345