Entry Kozen:1994:OBC from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
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{Kozen:1994:OBC,
author = "Dexter Kozen and Shmuel Zaks",
title = "Optimal bounds for the change-making problem",
journal = j-THEOR-COMP-SCI,
volume = "123",
number = "2",
pages = "377--388",
day = "31",
month = jan,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:51 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=123&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=123&issue=2&aid=1485",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "change-making problem; co-NP-complete problem;
computational complexity; game theory; greedy
algorithm; optimal bounds; optimal representation;
optimal representations; three-coin systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- B0250,
71(1)133,
75(3)311,
79(1)179,
91(1)119,
92(2)227,
92(2)291,
94(2)261,
95(2)307,
99(2)231,
100(1)243,
110(1)79,
110(1)197,
115(2)359,
117(1)3,
117(1)23,
117(1)45,
117(1)67,
117(1)99,
117(1)137,
117(1)169,
117(1)199,
117(1)227,
117(1)243,
117(1)273,
117(1)289,
117(1)z,
119(2)331,
123(1)89,
123(1)145,
123(2)351,
124(2)329,
127(2)395,
129(2)385,
132(1)209,
132(1)337,
134(1)87,
134(2)455
- bound,
72(2)251,
73(3)313,
74(2)121,
74(3)313,
74(3)329,
81(2)237,
82(1)19,
82(1)113,
82(1)157,
83(2)169,
85(1)155,
85(2)305,
86(2)267,
88(1)59,
91(2)265,
92(1)191,
93(2)279,
96(2)411,
97(2)233,
97(2)285,
98(2)289,
100(1)185,
100(1)223,
102(2)215,
102(2)253,
102(2)355,
106(2)221,
106(2)351,
107(1)77,
107(1)121,
108(2)251,
108(2)271,
108(2)311,
110(1)1,
112(2)355,
112(2)419,
113(1)75,
116(1)195,
116(2)305,
116(2)415,
119(2)267,
120(2)169,
121(1)279,
123(1)95,
123(1)145,
123(2)389,
125(2)329,
125(2)373,
127(2)395,
128(1)63,
129(1)193,
129(2)263,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)85,
130(1)163,
130(1)175,
131(2)243,
131(2)331,
132(1)259,
132(1)377,
132(1)387,
133(1)23,
133(1)105,
134(1)189,
134(1)253,
136(2)527
- greedy,
94(2)223,
130(1)49,
130(1)73,
134(2)473
- optimal,
71(3)401,
74(1)95,
74(2)183,
76(1)93,
76(2)331,
77(3)291,
80(1)105,
81(2)257,
82(1)113,
82(1)157,
84(1)127,
84(2)179,
85(1)155,
86(2)365,
87(2)251,
92(1)33,
92(1)87,
92(1)z,
93(2)245,
106(2)361,
108(2)271,
111(1)191,
115(2)351,
119(2)355,
120(2)197,
120(2)261,
125(1)91,
127(2)395,
128(1)179,
129(2)323,
130(1)17,
132(1)403,
134(2)263,
134(2)559
- representation,
70(3)305,
74(2)163,
74(2)183,
75(3)289,
77(1)97,
77(3)237,
78(1)159,
79(1)195,
80(1)35,
81(2)305,
83(2)219,
84(2)293,
85(2)253,
87(1)43,
88(1)171,
89(1)137,
90(2)433,
94(2)223,
97(1)157,
99(2)213,
108(2)331,
112(2)291,
117(1)131,
119(2)331,
120(1)101,
123(1)61,
123(2)291,
125(2)167,
126(1)77,
129(2)207,
133(2)307,
134(2)403,
135(2)267