Last update: Sun Oct 15 02:15:49 MDT 2017
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Moshkov:1997:UUB,
author = "Mikhail Moshkov",
title = "Unimprovable Upper Bounds on Time Complexity of
Decision Trees",
journal = j-FUND-INFO,
volume = "31",
number = "2",
pages = "157--184",
month = aug,
year = "1997",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-1997-31205",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 16:54:58 MST 2016",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fundinfo1990.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
Related entries
- bound,
25(3)271,
26(3)267,
27(2)197,
31(2)145
- complexity,
13(3)387,
17(1)117,
17(4)363,
20(4)353,
21(4)333,
22(3)289,
25(2)201,
25(3)327,
30(2)161,
32(2)139,
36(4)307,
38(1)25,
39(1)59,
39(3)249,
39(3)259,
39(4)337
- Decision,
21(4)391,
22(3)203,
25(2)201,
27(2)197,
27(2)255,
30(3)345,
31(1)49,
31(2)145,
32(3)341,
34(1)145,
37(1)1,
39(4)337,
40(4)317
- Moshkov, Mikhail,
21(4)391,
22(3)203,
25(2)201,
27(2)197,
31(2)145
- time,
19(3)403,
22(4)309,
29(1)51,
32(1)91,
33(1)1,
34(1)103,
35(1)91,
37(3)311,
38(1)1,
39(4)337,
40(2)199
- tree,
13(2)211,
21(4)367,
21(4)391,
22(3)203,
23(1)1,
24(1)157,
25(2)201,
26(3)267,
27(2)197,
29(4)325,
30(1)59,
30(2)125,
31(2)145,
32(1)27,
34(1)145,
34(1)175,
36(1)57,
38(1)79,
38(1)119,
39(3)259,
39(4)337