首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
Decomposing rational numbers
被引:1
作者
:
Lennerstad, Hakan
论文数:
0
引用数:
0
h-index:
0
机构:
Blekinge Inst Technol, Sch Engn, S-37179 Karlskrona, Sweden
Blekinge Inst Technol, Sch Engn, S-37179 Karlskrona, Sweden
Lennerstad, Hakan
[
1
]
Lundberg, Lars
论文数:
0
引用数:
0
h-index:
0
机构:
Blekinge Inst Technol, Sch Engn, S-37179 Karlskrona, Sweden
Blekinge Inst Technol, Sch Engn, S-37179 Karlskrona, Sweden
Lundberg, Lars
[
1
]
机构
:
[1]
Blekinge Inst Technol, Sch Engn, S-37179 Karlskrona, Sweden
来源
:
ACTA ARITHMETICA
|
2010年
/ 145卷
/ 03期
关键词
:
rational number;
Stern-Brocot tree;
ceiling function;
floor function;
decomposition;
relatively prime;
D O I
:
10.4064/aa145-3-1
中图分类号
:
O1 [数学];
学科分类号
:
0701 ;
070101 ;
摘要
:
[No abstract available]
引用
收藏
页码:213 / 220
页数:8
相关论文
共 5 条
[1]
[Anonymous], 1994, FDN COMPUTER SCI
[2]
Brocot A., 1861, Revue Chronometrique, V3, P186
[3]
PROOF OF THE 4/3 CONJECTURE FOR PREEMPTIVE VS NONPREEMPTIVE 2-PROCESSOR SCHEDULING
COFFMAN, EG
论文数:
0
引用数:
0
h-index:
0
机构:
AT&T Bell Laboratories, Murray Hill, New Jersey
COFFMAN, EG
GAREY, MR
论文数:
0
引用数:
0
h-index:
0
机构:
AT&T Bell Laboratories, Murray Hill, New Jersey
GAREY, MR
[J].
JOURNAL OF THE ACM,
1993,
40
(05)
: 991
-
1018
[4]
The maximum gain of increasing the number of preemptions in multiprocessor scheduling
Klonowska, Kamilla
论文数:
0
引用数:
0
h-index:
0
机构:
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Klonowska, Kamilla
Lundberg, Lars
论文数:
0
引用数:
0
h-index:
0
机构:
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Lundberg, Lars
Lennerstad, Hakan
论文数:
0
引用数:
0
h-index:
0
机构:
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Lennerstad, Hakan
[J].
ACTA INFORMATICA,
2009,
46
(04)
: 285
-
295
[5]
Stern M.A., 1858, J REINE ANGEW MATH, V55, P193, DOI DOI 10.1515/CRLL.1858.55.193
←
1
→
共 5 条
[1]
[Anonymous], 1994, FDN COMPUTER SCI
[2]
Brocot A., 1861, Revue Chronometrique, V3, P186
[3]
PROOF OF THE 4/3 CONJECTURE FOR PREEMPTIVE VS NONPREEMPTIVE 2-PROCESSOR SCHEDULING
COFFMAN, EG
论文数:
0
引用数:
0
h-index:
0
机构:
AT&T Bell Laboratories, Murray Hill, New Jersey
COFFMAN, EG
GAREY, MR
论文数:
0
引用数:
0
h-index:
0
机构:
AT&T Bell Laboratories, Murray Hill, New Jersey
GAREY, MR
[J].
JOURNAL OF THE ACM,
1993,
40
(05)
: 991
-
1018
[4]
The maximum gain of increasing the number of preemptions in multiprocessor scheduling
Klonowska, Kamilla
论文数:
0
引用数:
0
h-index:
0
机构:
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Klonowska, Kamilla
Lundberg, Lars
论文数:
0
引用数:
0
h-index:
0
机构:
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Lundberg, Lars
Lennerstad, Hakan
论文数:
0
引用数:
0
h-index:
0
机构:
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Blekinge Inst Technol, Sch Engn, Karlskrona, Sweden
Lennerstad, Hakan
[J].
ACTA INFORMATICA,
2009,
46
(04)
: 285
-
295
[5]
Stern M.A., 1858, J REINE ANGEW MATH, V55, P193, DOI DOI 10.1515/CRLL.1858.55.193
←
1
→