Entry Etzion-Petruschka:1994:SDS 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{Etzion-Petruschka:1994:SDS,
author = "Yael Etzion-Petruschka and David Harel and Dale
Myers",
title = "On the solvability of domino snake problems",
journal = j-THEOR-COMP-SCI,
volume = "131",
number = "2",
pages = "243--269",
day = "12",
month = sep,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:23 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=131&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=131&issue=2&aid=1580",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Appl. Math. and Comput. Sci., Weizmann Inst.
of Sci., Rehovot, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computability; computability theory;
computational complexity; decidability; domino snake
problems; lower bound; PSPACE-complete; solvability;
tile connectability problems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- 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)377,
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)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
- complete, PSPACE-,
80(1)77,
84(1)127,
88(1)99,
97(2)199,
110(1)197,
110(1)215,
112(2)371,
123(2)329,
134(1)225,
123(2)329
- computability,
73(3)313,
77(3)221,
80(2)203,
82(1)1,
86(2)377,
94(1)101,
97(1)1,
100(2)267,
113(2)191,
116(2)317,
119(1)187,
119(1)z,
121(1)89,
132(1)113,
133(1)65,
134(2)537
- decidability,
71(1)29,
71(2)265,
71(3)281,
72(1)39,
73(3)295,
74(1)3,
74(1)71,
74(3)341,
78(2)347,
79(1)37,
79(1)263,
80(1)77,
80(2)227,
80(2)303,
81(1)137,
81(2)269,
81(2)289,
82(1)19,
82(1)131,
85(1)33,
85(2)253,
87(1)25,
87(2)287,
88(2)269,
88(2)325,
89(1)33,
91(1)71,
91(1)101,
94(1)1,
94(2)367,
95(1)115,
95(2)187,
96(2)325,
98(1)5,
98(2)199,
99(2)291,
101(1)143,
103(1)39,
103(1)143,
103(2)387,
106(1)87,
106(1)135,
106(2)337,
108(1)103,
108(2)237,
109(1)83,
110(1)145,
110(2)419,
112(2)311,
113(1)93,
113(1)119,
114(1)93,
116(2)339,
117(1)39,
118(2)167,
118(2)193,
120(2)229,
121(1)71,
121(1)89,
123(2)315,
126(1)31,
126(1)113,
127(1)1,
127(1)69,
127(1)149,
127(2)229,
129(1)167,
129(2)419,
130(2)239,
131(2)271,
131(2)431,
131(2)441,
132(1)37,
132(1)85,
132(1)129,
132(1)395,
134(1)107,
134(1)175,
134(2)287,
134(2)311,
134(2)329,
134(2)365,
135(2)345
- domino,
98(2)263,
119(2)323
- lower,
74(3)313,
81(2)237,
82(1)113,
82(1)157,
83(2)169,
92(1)191,
93(2)279,
96(2)411,
97(2)285,
102(2)215,
106(2)351,
108(2)271,
111(1)59,
112(2)355,
112(2)419,
113(1)75,
116(2)415,
119(2)267,
123(2)389,
125(2)373,
127(2)395,
128(1)63,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)163,
130(1)175,
130(1)203,
131(2)331,
133(1)23,
134(1)253
- PSPACE-complete,
80(1)77,
84(1)127,
88(1)99,
97(2)199,
110(1)197,
110(1)215,
112(2)371,
123(2)329,
134(1)225
- snake,
119(2)323
- solvability,
72(2)119
- tile,
123(1)151