Entry Durand:1995:RNC 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{Durand:1995:RNC,
author = "Bruno Durand",
title = "A {Random NP}-complete problem for inversion of {$2$D}
cellular automata",
journal = j-THEOR-COMP-SCI,
volume = "148",
number = "1",
pages = "19--32",
day = "21",
month = aug,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:18 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&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=148&issue=1&aid=1873",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240C (Computational
complexity)",
corpsource = "Lab. de l'Inf. du Parallelisme, ENS-Lyon CNRS, Lyon,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2D cellular automata inversion; cellular automata;
co-RNP-completeness; computational complexity; finite
tilings; polynomial reduction; probability; probability
functions; random NP-complete problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- $2$,
154(2)247,
174(1)137,
198(1)1,
204(1)29,
210(2)327,
218(2)347,
225(1)1
- cellular,
134(1)51,
141(1)1,
141(1)331,
143(1)23,
145(1)1,
147(1)165,
148(1)157,
154(2)349,
156(1)281,
163(1)291,
165(2)475,
168(2)337,
168(2)367,
169(2)123,
174(1)157,
178(1)77,
180(1)229,
188(1)45,
188(1)195,
201(1)171,
205(1)135,
215(1)239,
217(1)3,
217(1)31,
217(1)53,
217(1)81,
217(1)99,
217(1)131,
218(2)325,
218(2)347,
221(1)157,
225(1)81
- complete, NP-,
147(1)137,
155(2)321,
161(1)289,
186(1)157
- complete, NP-,
147(1)137,
155(2)321,
161(1)289,
186(1)157
- D,
140(2)205,
147(1)211,
186(1)1,
218(2)347
- Durand, Bruno,
215(1)225,
221(1)61
- inversion,
163(1)211
- NP-complete,
137(1)129,
143(2)353,
147(1)117,
147(1)137,
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
- probability,
138(2)315,
144(1)125,
144(1)161,
144(1)221,
147(1)267,
148(1)133,
149(1)67,
152(2)219,
155(1)141,
155(2)349,
156(1)39,
156(1)315,
157(2)277,
159(1)65,
159(1)81,
164(1)107,
171(1)147,
172(1)43,
174(1)193,
176(1)1,
181(1)45,
184(1)237,
188(1)1,
191(1)215,
193(1)53,
202(1)1,
207(1)245,
219(1)421,
254(1)691
- random,
143(1)73,
144(1)67,
144(1)125,
144(1)277,
145(1)381,
147(1)267,
152(2)171,
152(2)219,
154(1)23,
156(1)301,
159(1)5,
159(1)29,
159(1)43,
162(1)151,
162(2)341,
164(1)107,
169(2)147,
175(2)393,
178(1)155,
190(2)151,
191(1)185,
196(1)3,
196(1)109,
201(1)281,
207(2)343,
207(2)387,
215(1)1,
218(2)219,
218(2)233,
218(2)263,
219(1)287,
226(1)29,
229(1)103
- reduction,
135(1)67,
139(1)69,
145(1)147,
146(1)269,
148(2)183,
148(2)325,
151(2)353,
151(2)437,
152(1)91,
154(1)3,
154(1)23,
155(1)85,
155(2)447,
158(1)361,
159(2)191,
161(1)69,
165(1)75,
166(1)1,
168(1)3,
170(1)83,
173(1)151,
175(1)93,
177(1)183,
181(2)229,
185(2)237,
188(1)101,
189(1)221,
190(1)3,
190(1)61,
191(1)97,
191(1)157,
192(1)31,
192(1)55,
194(1)241-2,
194(1)244-1,
194(1)244-3,
194(1)245-2,
194(1)247-2,
194(1)248-2,
197(1)242-2,
198(1)239,
209(1)47,
212(1)211,
225(1)185
- tiling,
147(1)165,
156(1)1,
159(1)103,
159(1)105,
159(1)137,
178(1)275,
218(2)285,
218(2)297,
221(1)61