Density bounds for the 3x + 1 problem. I. Tree-search method

被引：0

|

作者：

机构：

来源：

Mathematics of Computation | / 64卷 / 209期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[1] DENSITY BOUNDS FOR THE 3X+1 PROBLEM .1. TREE-SEARCH METHOD
APPLEGATE, D
LAGARIAS, JC
MATHEMATICS OF COMPUTATION, 1995, 64 (209) : 411 - 426
[2] A tree-search method for solving a cutting stock assignment problem
Smith, NR
Al-Khayyal, F
Griffin, P
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (07) : 1557 - 1578
[3] 3X + 1 PROBLEM
CRANDALL, RE
MATHEMATICS OF COMPUTATION, 1978, 32 (144) : 1281 - 1292
[4] A NOTE ON THE 3X + 1 PROBLEM
KOREC, I
ZNAM, S
AMERICAN MATHEMATICAL MONTHLY, 1987, 94 (08): : 771 - 772
[5] The x-ray interferences in diamond as a wave-mechanical problem. Part I.
Ewald, PP
Honl, H
ANNALEN DER PHYSIK, 1936, 25 (04) : 0281 - 0308
[6] DENSITY BOUNDS FOR THE 3X+1 PROBLEM .2. KRASIKOV INEQUALITIES
APPLEGATE, D
LAGARIAS, JC
MATHEMATICS OF COMPUTATION, 1995, 64 (209) : 427 - 438
[7] Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search
Everitt, Tom
Hutter, Marcus
AI 2015: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2015, 9457 : 157 - 165
[8] ANALYSIS OF LOCAL NEIGHBORHOOD SEARCH METHOD FOR 0-1 KNAPSACK PROBLEM.
Nakano, Hideo
Tateishi, Satoru
Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi), 1987, 70 (01): : 31 - 41
[9] Green's function method for the radiative transfer problem. I. Homogeneous non-Lambertian surface
Lyapustin, A
Knyazikhin, Y
APPLIED OPTICS, 2001, 40 (21) : 3495 - 3501
[10] Bounds for the 3x+1 problem using difference inequalities
Krasikov, I
Lagarias, JC
ACTA ARITHMETICA, 2003, 109 (03) : 237 - 258

← 1 2 3 4 5 →