Entry Seese:1998:LTC 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{Seese:1998:LTC,
author = "D. Seese",
title = "Linear time computable problems and logical
descriptions",
journal = j-THEOR-COMP-SCI,
volume = "194",
number = "1--2",
pages = "247--??",
day = "10",
month = mar,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed May 27 07:21:35 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240C (Computational
complexity)",
conflocation = "Pisa, Italy; 28 Aug.-1 Sept. 1995",
conftitle = "Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA '95) (papers in summary form
only received)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "BIORAM; bounded degree; complexity; computability;
computational complexity; first-order logic; formal
logic; linear time algorithms; linear time computable;
problem description language; universally bounded
degree",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bounded,
137(1)3,
139(1)131,
148(1)93,
151(1)163,
163(1)177,
164(1)59,
164(1)287,
166(1)203,
168(1)3,
168(1)21,
169(2)201,
172(1)135,
172(1)195,
173(1)183,
175(2)309,
176(1)89,
176(1)283,
178(1)103,
181(1)141,
181(2)267,
182(1)145,
191(1)61,
193(1)53,
193(1)75,
193(1)113,
194(1)137,
196(1)395,
204(1)11,
209(1)1
- 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)145,
191(1)229,
192(2)315,
193(1)149,
194(1)219,
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
- computable,
139(1)243,
143(1)113,
145(1)241,
161(1)235,
162(1)45,
162(1)117,
169(1)67,
172(1)233,
175(1)183,
188(1)175,
192(2)315,
197(1)79,
210(1)3,
219(1)95,
219(1)111,
219(1)169,
219(1)319,
221(1)157,
224(1)13
- degree,
147(1)137,
155(2)425,
157(1)129,
161(1)301,
161(1)307,
177(1)59,
180(1)353,
181(1)91,
181(1)119,
181(2)267,
205(1)261
- description,
138(1)35,
146(1)243,
161(1)157,
165(2)325,
179(1)251
- first-order,
139(1)207,
142(2)141,
144(1)59,
146(1)69,
146(1)243,
148(2)261,
149(1)49,
149(1)67,
149(1)101,
152(1)91,
154(1)67,
156(1)177,
160(1)241,
160(1)271,
160(1)305,
165(1)3,
166(1)63,
170(1)173,
171(1)179,
172(1)135,
173(1)151,
173(2)349,
173(2)393,
173(2)513,
176(1)67,
176(1)283,
184(1)237,
185(1)47,
185(2)217,
185(2)393,
192(2)315,
193(1)129,
197(1)247-1,
208(1)179,
216(1)55,
222(1)55,
222(1)153
- logical,
137(1)3,
138(1)201,
141(1)283,
143(1)51,
148(1)67,
149(2)201,
152(1)91,
154(1)67,
163(1)99,
166(1)173,
171(1)61,
173(2)311,
174(1)231,
175(1)75,
175(1)z,
176(1)283,
183(2)187,
184(1)105,
184(1)237,
191(1)173,
195(2)227,
197(1)246-2
- order, first-,
139(1)207,
142(2)141,
144(1)59,
146(1)69,
146(1)243,
148(2)261,
149(1)49,
149(1)67,
149(1)101,
152(1)91,
154(1)67,
156(1)177,
160(1)241,
160(1)271,
165(1)3,
166(1)63,
170(1)173,
171(1)179,
172(1)135,
173(1)151,
173(2)349,
173(2)393,
173(2)513,
176(1)67,
176(1)283,
184(1)237,
185(1)47,
185(2)217,
185(2)393,
192(2)315,
193(1)129,
197(1)247-1,
208(1)179,
216(1)55,
222(1)55,
222(1)153
- universally,
165(1)57,
171(1)147