Entry Bodlaender:1993:CPF 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{Bodlaender:1993:CPF,
author = "Hans L. Bodlaender",
title = "Complexity of path-forming games",
journal = j-THEOR-COMP-SCI,
volume = "110",
number = "1",
pages = "215--245",
day = "15",
month = mar,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:02 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=110&issue=1;
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=1993&volume=110&issue=1&aid=1375",
acknowledgement = ack-nhfb,
classification = "C1140E (Game theory); C1180 (Optimisation
techniques); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; dynamic
programming; game instance; game theory; generalized
geography; graph rewriting; linear-time-solvable;
path-forming games; polynomial-time algorithms;
PSPACE-complete; two-player games",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- Bodlaender, Hans L.,
106(2)309
- C1140E,
91(1)119,
92(2)291,
95(1)115,
96(2)361,
96(2)389,
98(1)137,
98(2)263,
98(2)339,
106(2)309,
106(2)351,
108(2)311,
110(1)169,
110(1)197,
112(2)355,
112(2)371,
119(2)311,
119(2)323,
123(1)3,
123(2)183,
124(2)273,
128(1)179,
129(2)385,
130(1)85,
130(1)101,
131(2)415,
131(2)431,
132(1)337,
132(1)347,
136(2)527
- C1180,
84(1)77,
92(1)49,
92(1)181,
94(2)175,
97(1)105,
97(1)175,
99(1)157,
102(1)185,
102(2)253,
106(2)361,
107(1)145,
123(1)9,
125(1)17,
128(1)179,
129(2)323,
130(1)73,
132(1)347,
133(1)85,
133(1)105,
134(2)263
- complete, PSPACE-,
80(1)77,
84(1)127,
88(1)99,
97(2)199,
110(1)197,
112(2)371,
123(2)329,
131(2)243,
134(1)225,
123(2)329
- dynamic,
72(2)97,
72(2)147,
72(2)z,
74(1)95,
76(1)115,
79(1)151,
79(2)341,
84(1)127,
87(1)43,
87(1)189,
89(1)161,
90(1)95,
90(2)355,
91(2)181,
92(1)49,
92(1)z,
92(2)291,
93(2)201,
94(1)141,
94(2)223,
94(2)335,
95(1)1,
97(1)1,
106(2)361,
116(2)359,
119(1)63,
119(1)223,
119(2)331,
124(1)127,
127(2)387,
128(1)179,
129(2)279,
129(2)397,
130(1)49,
130(1)203,
131(2)295,
133(2)205,
134(1)79,
136(1)217
- generalized,
70(1)35,
79(1)137,
79(1)263,
83(2)261,
84(2)165,
89(1)107,
90(1)61,
91(1)23,
91(1)101,
92(2)269,
104(2)285,
111(1)103,
112(1)53,
112(1)99,
112(2)399,
116(1)117,
116(2)405,
117(1)137,
119(1)103,
119(2)267,
123(2)329,
127(2)269,
131(1)121,
133(1)65
- geography,
110(1)197,
112(2)371,
123(2)329
- instance,
81(1)49,
86(1)81,
130(1)5
- optimisation,
76(1)143,
84(1)77,
92(1)49,
92(1)181,
94(2)175,
97(1)105,
97(1)175,
99(1)157,
102(1)185,
102(2)253,
104(2)285,
106(2)361,
107(1)145,
123(1)9,
125(1)17,
128(1)179,
129(2)323,
130(1)73,
132(1)347,
133(1)85,
133(1)105,
134(2)263,
134(2)559
- player, two-,
96(2)361
- polynomial-time,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473
- PSPACE-complete,
80(1)77,
84(1)127,
88(1)99,
97(2)199,
110(1)197,
112(2)371,
123(2)329,
131(2)243,
134(1)225
- time, polynomial-,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473
- two-player,
96(2)361