Entry Amaldi:1995:CAF 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{Amaldi:1995:CAF,
author = "Edoardo Amaldi and Viggo Kann",
title = "The complexity and approximability of finding maximum
feasible subsystems of linear relations",
journal = j-THEOR-COMP-SCI,
volume = "147",
number = "1--2",
pages = "181--210",
day = "7",
month = aug,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:16 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-2;
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=147&issue=1-2&aid=1888",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C1230D (Neural
nets); C4240C (Computational complexity); C5290 (Neural
computing techniques)",
corpsource = "Dept. of Math., Swiss Federal Inst. of Technol.,
Lausanne, Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximability; APX-complete problems; artificial
neural networks; combinatorial problem; complexity;
computational complexity; linear classifiers; linear
relations; MAX FLS; maximum feasible subsystems; NP
optimization problems; NP-hard; optimisation;
perceptrons",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- Amaldi, Edoardo,
209(1)237
- approximability,
161(1)307,
181(1)107,
209(1)237
- C1180,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365,
197(1)245-2
- C1230D,
134(1)51,
143(2)251,
158(1)279,
168(2)405,
168(2)461,
172(1)91,
178(1)77,
185(1)15
- C5290,
141(1)1,
156(1)217,
174(1)123
- computing,
137(1)129,
138(1)211,
139(1)69,
141(1)1,
141(1)175,
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
- feasible,
138(1)201,
140(2)231,
147(1)31,
207(1)245,
225(1)185
- finding,
145(1)317,
145(1)357,
157(2)273,
172(1)265,
172(1)303,
203(1)151
- hard;, NP-,
143(1)93,
143(1)113,
161(1)123,
181(2)379,
197(1)171
- Kann, Viggo,
209(1)237
- MAX,
143(1)137,
145(1)317
- maximum,
140(2)301,
145(1)357,
148(1)165,
150(1)1,
158(1)117,
164(1)277,
174(1)23,
181(1)91,
181(1)107,
181(2)307,
191(1)193,
196(1)201
- neural,
134(1)51,
141(1)1,
143(2)251,
156(1)217,
158(1)279,
168(2)405,
168(2)461,
172(1)91,
174(1)123,
178(1)77,
182(1)257,
185(1)15
- NP,
137(2)279,
141(1)175,
145(1)111,
145(1)147,
147(1)55,
148(2)207,
148(2)325,
150(1)1,
154(2)145,
154(2)283,
157(2)161,
158(1)143,
158(1)221,
160(1)185,
164(1)59,
164(1)141,
174(1)97,
181(2)229,
189(1)239
- NP-hard,
143(1)93,
143(1)113,
161(1)123,
162(2)225,
169(1)23,
181(2)379,
191(1)229,
197(1)171
- optimisation,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365,
197(1)245-2
- optimization,
142(1)27,
144(1)125,
145(1)189,
146(1)69,
146(1)145,
146(1)269,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
173(1)3,
173(1)113,
174(1)23,
180(1)269,
187(1)231,
191(1)229,
193(1)149,
194(1)207,
196(1)365,
207(1)203,
209(1)107,
227(1)299
- relation,
137(2)237,
138(2)391,
139(1)275,
139(1)315,
140(1)139,
141(1)311,
143(2)251,
143(2)269,
147(1)165,
148(2)227,
149(1)3,
149(1)129,
149(1)179,
149(2)201,
149(2)299,
149(2)333,
150(1)77,
150(1)161,
151(2)437,
152(2)171,
152(2)269,
152(2)285,
155(1)85,
156(1)281,
159(2)191,
159(2)245,
159(2)355,
160(1)1,
160(1)305,
162(1)5,
162(1)45,
165(1)3,
167(1)171,
168(1)155,
171(1)281,
172(1)135,
172(1)309,
173(2)513,
174(1)67,
174(1)97,
175(2)373,
176(1)235,
176(1)283,
177(1)183,
179(1)103,
179(1)273,
180(1)1,
181(1)45,
184(1)105,
186(1)83,
186(1)157,
187(1)203,
188(1)211,
193(1)129,
195(2)183,
198(1)159,
206(1)283,
207(1)105,
209(1)237,
209(1)287,
215(1)263