Entry Koscielski:1998:MAP 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{Koscielski:1998:MAP,
author = "Antoni Ko{\'s}cielski and Leszek Pacholski",
title = "{Makanin}'s algorithm is not primitive recursive",
journal = j-THEOR-COMP-SCI,
volume = "191",
number = "1--2",
pages = "145--156",
day = "30",
month = jan,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:31 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=191&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/191/1-2/2522.pdf",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. of Comput. Sci., Wroclaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; computability; free groups;
primitive recursive; recursive functions;
satisfiability of equations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- computability,
137(1)129,
139(1)243,
142(1)27,
145(1)111,
147(1)31,
153(1)49,
154(2)145,
155(1)277,
157(1)79,
157(1)91,
157(2)267,
160(1)365,
161(1)109,
161(1)289,
162(1)5,
162(1)23,
162(1)45,
162(1)117,
163(1)177,
165(1)133,
166(1)147,
168(2)241,
168(2)461,
171(1)3,
172(1)233,
174(1)137,
175(1)183,
175(2)349,
181(1)195,
184(1)195,
190(2)279,
191(1)229,
192(2)315,
193(1)149,
194(1)219,
194(1)247-1,
195(2)183,
210(1)73,
219(1)65,
219(1)185,
219(1)287,
219(1)421,
219(1)467,
219(1)487,
224(1)173
- equation,
138(1)67,
143(1)51,
144(1)59,
144(1)161,
145(1)71,
147(1)267,
151(1)257,
153(1)49,
154(1)3,
155(1)221,
155(1)267,
157(1)3,
157(1)79,
157(1)115,
157(1)z,
162(2)225,
168(1)105,
170(1)349,
173(1)183,
176(1)205,
176(1)347,
177(1)217,
177(2)407,
179(1)217,
180(1)287,
186(1)83,
187(1)3,
187(1)7,
187(1)27,
187(1)49,
187(1)81,
187(1)87,
187(1)179,
187(1)263,
187(1)z,
192(1)3,
193(1)113,
196(1)395,
197(1)247,
216(1)395,
224(1)215,
225(1)149
- free,
138(2)391,
141(1)331,
142(2)229,
145(1)229,
152(1)91,
153(1)271,
160(1)241,
163(1)55,
164(1)223,
165(2)325,
165(2)355,
168(1)105,
170(1)47,
175(2)393,
179(1)421,
183(1)83,
187(1)105,
191(1)117,
192(1)107,
197(1)189,
204(1)35,
204(1)131,
224(1)13,
224(1)157,
225(1)149
- group,
145(1)229,
146(1)321,
150(1)77,
154(2)387,
161(1)157,
161(1)191,
163(1)259,
164(1)223,
165(2)275,
169(2)185,
176(1)347,
178(1)257,
180(1)17,
181(1)195,
183(2)187,
187(1)3,
187(1)27,
187(1)123,
187(1)263,
188(1)231,
191(1)219,
192(2)287,
194(1)248,
204(1)233,
208(1)149,
225(1)177
- not,
147(1)149,
155(2)411,
156(1)281,
163(1)145,
164(1)141,
209(1)163,
224(1)291
- primitive,
152(1)1,
154(2)247,
155(1)39,
155(1)179,
157(2)273,
161(1)141,
163(1)269,
164(1)29,
176(1)111,
187(1)3,
192(2)167,
193(1)129
- recursive,
139(1)315,
139(1)355,
141(1)151,
143(2)251,
144(1)221,
146(1)69,
146(1)243,
146(1)269,
147(1)19,
149(1)101,
151(1)207,
152(1)1,
152(2)285,
154(2)307,
156(1)177,
161(1)123,
161(1)235,
162(1)5,
162(1)23,
162(1)45,
163(1)269,
163(1)309,
164(1)13,
165(2)325,
169(1)113,
170(1)349,
175(1)127,
176(1)205,
181(1)45,
181(1)119,
181(1)141,
185(1)129,
190(1)61,
191(1)215,
193(1)113,
193(1)129,
194(1)241,
197(1)139,
201(1)63,
208(1)33,
210(1)99,
219(1)3
- satisfiability,
137(1)129,
139(1)1,
145(1)111,
146(1)243,
150(1)1,
155(1)277,
160(1)365,
161(1)109,
165(1)133,
166(1)147,
170(1)1,
171(1)3,
172(1)233,
175(2)349,
181(1)195,
184(1)195,
193(1)149,
195(2)183