Entry Leggett:1981:OPP from tcs1980.bib
Last update: Thu Sep 27 02:46:46 MDT 2018
Top |
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{Leggett:1981:OPP,
author = "E. W. {Leggett, Jr.} and D. J. Moore",
title = "Optimization problems and the polynomial hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "3",
pages = "279--289",
month = sep,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques)",
corpsource = "Clemson Univ., Clemson, SC, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Chromatic Number Problem; Knapsack Packing Problem;
Maximal Clique Problem; optimisation; optimisation
problems; polynomial hierarchy; Symmetric Traveling
Salesman Problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- C1180,
10(2)123,
11(1)1,
12(1)83,
14(3)289,
15(1)27,
15(3)251,
16(2)187,
19(1)1,
19(2)189,
19(3)337,
21(1)99,
21(3)255
- hierarchy,
12(2)161,
13(2)137,
18(1)95,
21(3)341,
21(3)351,
23(1)11,
23(2)217,
23(3)243,
23(3)287,
23(3)333,
24(1)53,
25(2)193,
26(3)287,
26(3)327,
28(3)315
- maximal,
14(1)103,
14(3)289,
16(2)211
- number,
10(2)133,
11(2)207,
11(3)303,
12(1)97,
13(3)331,
14(3)211,
14(3)227,
14(3)247,
18(1)105,
18(3)259,
22(1)19,
22(3)331,
23(1)37,
23(1)69,
23(2)211,
23(3)287,
29(3)325,
31(1)61,
31(1)101,
31(1)125,
31(1)139,
33(1)85
- optimisation,
10(2)123,
11(1)1,
12(1)83,
14(1)79,
14(1)103,
14(3)289,
15(1)27,
15(3)251,
16(2)187,
19(1)1,
19(2)189,
19(3)337,
21(1)99,
21(3)255
- optimization,
12(1)83,
14(3)289,
15(3)251,
18(1)41
- polynomial,
10(1)1,
10(1)53,
10(2)111,
11(1)93,
11(3)321,
11(3)331,
11(3)337,
12(1)1,
12(2)161,
12(3)303,
13(3)271,
14(1)91,
14(3)289,
15(1)27,
15(1)77,
15(3)251,
15(3)329,
16(2)223,
17(1)91,
17(2)163,
18(1)95,
19(1)17,
19(3)287,
21(1)99,
21(1)105,
21(2)179,
21(3)255,
22(1)195,
22(3)285,
22(3)317,
23(1)95,
24(3)291,
25(1)67,
26(1)25,
27(1)3,
27(1)127,
28(1)135,
31(1)101,
31(1)125,
31(3)227,
32(1)61,
32(3)279,
34(1)17,
34(1)207
- salesman,
19(2)189
- symmetric,
19(2)161,
34(1)215
- technique,
10(2)123,
11(1)1,
11(2)145,
12(1)83,
12(3)325,
13(1)61,
13(1)109,
14(1)19,
14(3)289,
15(1)27,
15(3)251,
16(2)187,
19(1)1,
19(2)189,
19(3)321,
19(3)337,
21(1)99,
21(3)255,
22(1)19,
24(1)1,
31(1)13,
32(1)77,
33(1)117,
33(1)z
- traveling,
19(2)189