Entry Shinohara:1995:CCV from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Shinohara:1995:CCV,
author = "Ayumi Shinohara",
title = "Complexity of computing {Vapnik--Chervonenkis}
dimension and some generalized dimensions",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "1",
pages = "129--144",
day = "09",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:44 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=1&aid=1791",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240C (Computational
complexity)",
conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
conftitle = "4th International Workshop, ALT'93. Algorithmic
Learning Theory",
corpsource = "Res. Inst. of Fundamental Inf. Sci., Kyushu Univ.,
Fukuoka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computability; computational complexity;
conjunctive normal form; learnability; learning
(artificial intelligence); NP-complete; PAC-learning;
polynomial-time reducible; satisfiability;
Vapnik--Chervonenkis dimension; VC-dimension",
pubcountry = "Netherlands",
sponsororg = "Japanese Soc. Artificial Intelligence",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Chervonenkis, Vapnik-,
172(1)43,
188(1)79
- complete;, NP-,
143(2)353,
147(1)117,
148(1)93,
163(1)161,
164(1)287,
165(2)233,
175(2)309,
178(1)265,
180(1)269,
181(1)159,
181(2)267,
186(1)107,
191(1)205,
197(1)245-2,
198(1)211
- computability,
139(1)243,
142(1)27,
145(1)111,
147(1)31,
153(1)49,
154(2)145,
155(1)277,
157(1)79,
157(1)91,
157(2)267,
160(1)365,
161(1)109,
161(1)289,
162(1)5,
162(1)23,
162(1)45,
162(1)117,
163(1)177,
165(1)133,
166(1)147,
168(2)241,
168(2)461,
171(1)3,
172(1)233,
174(1)137,
175(1)183,
175(2)349,
181(1)195,
184(1)195,
190(2)279,
191(1)145,
191(1)229,
192(2)315,
193(1)149,
194(1)219,
194(1)247-1,
195(2)183,
210(1)73,
219(1)65,
219(1)185,
219(1)287,
219(1)421,
219(1)467,
219(1)487,
224(1)173
- computing,
138(1)211,
139(1)69,
141(1)1,
141(1)175,
147(1)181,
149(1)101,
155(1)157,
156(1)99,
156(1)217,
157(1)115,
161(1)69,
163(1)269,
164(1)107,
164(1)299,
168(2)321,
169(1)67,
174(1)123,
180(1)115,
180(1)287,
181(1)159,
181(1)181,
181(1)195,
182(1)159,
185(2)259,
187(1)81,
187(1)87,
187(1)105,
187(1)117,
187(1)123,
187(1)147,
187(1)221,
187(1)231,
187(1)249,
187(1)263,
187(1)z,
190(1)61,
191(1)1,
192(2)315,
194(1)123,
194(1)225,
194(1)241,
194(1)242-1,
194(1)z,
195(1)3,
196(1)109,
196(1)153,
196(1)319,
197(1)79,
197(1)157,
197(1)171,
199(1)145,
209(1)331,
209(1)389
- conjunctive,
190(2)167
- dimension,
137(2)177,
172(1)43,
175(2)309,
178(1)265,
180(1)363,
188(1)79,
210(1)217
- dimension, VC-,
137(1)109,
185(1)159
- form,
139(1)115,
139(1)243,
139(1)315,
146(1)185,
152(2)269,
152(2)285,
154(1)41,
155(1)1,
155(1)85,
155(1)141,
157(1)53,
157(1)79,
159(2)343,
161(1)205,
170(1)407,
176(1)39,
185(2)379,
186(1)231,
190(1)41,
194(1)z,
195(2)155,
197(1)z,
208(1)33
- generalized,
145(1)159,
151(1)257,
154(2)165,
155(1)141,
158(1)53,
160(1)305,
161(1)301,
170(1)349,
174(1)203,
174(1)269,
177(1)183,
188(1)221,
193(1)1,
194(1)87,
197(1)248-1,
199(1)167,
200(1)313,
201(1)171,
215(1)191,
218(1)123
- learnability,
137(1)25,
164(1)13,
172(1)91,
185(1)15,
197(1)139
- learning,
137(1)25,
137(1)53,
137(1)85,
137(1)145,
137(1)159,
140(2)249,
141(1)151,
141(1)253,
148(1)141,
149(1)129,
154(2)183,
155(2)365,
161(1)235,
163(1)161,
164(1)13,
172(1)43,
172(1)91,
174(1)251,
180(1)155,
185(1)47,
185(1)63,
185(1)81,
185(1)129,
185(1)159,
185(1)177,
185(1)191,
188(1)79,
188(1)175,
197(1)139,
209(1)141
- learning;, PAC-,
185(1)177
- normal,
139(1)243,
139(1)315,
146(1)185,
152(2)269,
152(2)285,
155(1)1,
155(1)85,
157(1)53,
161(1)205,
170(1)383,
170(1)407,
171(1)111,
178(1)155,
185(2)379,
186(1)231,
190(1)41,
208(1)33
- NP-complete,
143(2)353,
147(1)117,
147(1)137,
148(1)19,
148(1)93,
155(2)321,
161(1)289,
163(1)161,
164(1)287,
165(2)233,
175(2)309,
178(1)265,
180(1)269,
181(1)159,
181(2)267,
186(1)107,
186(1)157,
191(1)205,
197(1)245-2,
198(1)211
- PAC-learning,
185(1)159,
185(1)177
- polynomial-time,
137(2)279,
141(1)109,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
181(2)229,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- reducible,
145(1)329,
180(1)269,
190(2)363
- satisfiability,
139(1)1,
145(1)111,
146(1)243,
150(1)1,
155(1)277,
160(1)365,
161(1)109,
165(1)133,
166(1)147,
170(1)1,
171(1)3,
172(1)233,
175(2)349,
181(1)195,
184(1)195,
191(1)145,
193(1)149,
195(2)183
- time, polynomial-,
137(2)279,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- Vapnik--Chervonenkis,
172(1)43,
188(1)79
- VC-dimension,
137(1)109,
185(1)159