Entry Lincoln:1998:CLP 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{Lincoln:1998:CLP,
author = "P. D. Lincoln and J. C. Mitchell and A. Scedrov",
title = "The complexity of local proof search in linear logic",
journal = j-THEOR-COMP-SCI,
volume = "197",
number = "1--2",
pages = "245--??",
day = "15",
month = may,
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 = "C1140E (Game theory); C1180 (Optimisation
techniques); C4210 (Formal logic); C4240C
(Computational complexity)",
conflocation = "Tokyo, Japan; 28 March-2 April 1996",
conftitle = "Linear Logic '96 (papers in summary form only
received)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; formal logic; game theory;
linear logic; linear logic proof games; local proof
search complexity; lower bounds; MALL; MLL;
multiplicative-additive fragment; NP-complete;
optimisation; partial proof tree; proof search
heuristics; propositional linear logic formulas;
PSACE-complete; randomization",
pubcountry = "Netherlands",
treatment = "G General Review",
xxnote = "Check page numbers: duplicate in adjacent entries",
}
Related entries
- bound,
139(1)355,
140(2)265,
140(2)301,
141(1)175,
143(2)335,
145(1)45,
145(1)271,
148(1)141,
151(1)163,
154(1)107,
154(2)165,
154(2)283,
155(2)411,
156(1)99,
156(1)315,
157(1)129,
157(2)139,
157(2)161,
157(2)185,
157(2)259,
158(1)143,
161(1)301,
162(2)341,
163(1)177,
165(2)247,
168(1)105,
172(1)1,
172(1)293,
175(2)283,
175(2)373,
179(1)251,
179(1)301,
180(1)243,
181(1)45,
181(1)119,
181(2)307,
184(1)61,
185(1)47,
188(1)59,
188(1)117,
192(1)3,
194(1)163,
196(1)153,
197(1)95,
201(1)63,
205(1)297,
209(1)47,
209(1)141,
209(1)389,
212(1)3
- C1140E,
137(2)253,
141(1)133,
142(2)229,
143(1)93,
143(2)319,
148(1)111,
156(1)263,
157(2)161,
157(2)215,
158(1)343,
159(1)137,
163(1)99,
164(1)253,
172(1)121,
174(1)97,
174(1)247,
175(2)283,
180(1)1,
182(1)217,
191(1)157,
197(1)203,
197(1)241
- C1180,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365
- complete;, NP-,
137(1)129,
143(2)353,
147(1)117,
148(1)93,
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,
191(1)205,
198(1)211
- formula,
138(1)169,
141(1)269,
155(1)277,
160(1)87,
171(1)3,
171(1)179,
179(1)353,
182(1)183,
185(1)177,
193(1)129,
195(2)183,
207(2)383
- fragment,
156(1)177,
176(1)159,
176(1)283,
183(2)187,
183(2)215,
197(1)242-1,
197(1)245,
197(1)246-1,
224(1)267
- heuristic,
154(1)57,
162(2)225,
164(1)59,
229(1)103
- local,
138(1)141,
138(2)391,
144(1)67,
145(1)95,
147(1)1,
148(2)261,
151(2)487,
153(1)129,
154(2)329,
155(2)349,
155(2)439,
163(1)303,
168(1)155,
172(1)265,
173(1)89,
173(1)235,
173(1)283,
178(1)275,
183(2)229,
186(1)199,
187(1)7,
187(1)87,
191(1)229,
192(2)233,
194(1)245,
195(1)33,
204(1)87,
205(1)297,
220(1)247
- lower,
140(2)301,
143(2)335,
145(1)45,
154(2)283,
155(2)411,
156(1)315,
157(2)139,
157(2)185,
157(2)259,
162(2)341,
163(1)177,
172(1)1,
172(1)293,
175(2)283,
179(1)251,
179(1)301,
181(1)119,
185(1)47,
188(1)59,
188(1)117,
193(1)1,
194(1)163,
196(1)153,
197(1)95,
209(1)47,
209(1)141,
209(1)389
- NP-complete,
137(1)129,
143(2)353,
147(1)117,
147(1)137,
148(1)19,
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,
198(1)211
- optimisation,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365
- partial,
138(2)273,
139(1)163,
140(1)73,
151(1)195,
152(1)91,
154(2)379,
155(1)157,
155(2)291,
160(1)87,
161(1)289,
162(1)79,
162(2)225,
164(1)287,
168(1)21,
168(1)155,
170(1)129,
170(1)145,
170(1)209,
171(1)247,
172(1)1,
173(2)513,
175(1)3,
175(1)127,
175(2)373,
179(1)217,
179(1)421,
180(1)243,
180(1)341,
181(1)195,
184(1)61,
184(1)145,
187(1)263,
190(2)167,
190(2)317,
192(1)55,
194(1)1,
194(1)183,
194(1)245,
194(1)246,
195(2)259,
206(1)127,
206(1)181,
209(1)1,
210(1)121,
216(1)311,
218(1)135,
219(1)379,
224(1)215
- proof,
135(1)67,
138(1)113,
138(2)243,
139(1)355,
140(1)95,
141(1)69,
150(1)161,
151(1)3,
151(2)487,
152(2)219,
153(1)49,
155(2)439,
165(1)3,
165(1)75,
165(1)171,
166(1)1,
166(1)173,
166(1)291,
167(1)171,
169(1)3,
170(1)1,
170(1)129,
170(1)407,
173(2)311,
173(2)393,
175(1)29,
175(1)159,
176(1)159,
176(1)283,
177(2)487,
178(1)257,
179(1)103,
179(1)137,
179(1)333,
180(1)309,
180(1)371,
181(2)317,
183(2)253,
184(1)1,
185(2)319,
188(1)211,
189(1)71,
190(1)41,
191(1)37,
191(1)215,
193(1)53,
194(1)244-3,
194(1)247-2,
194(1)z,
197(1)242-3,
197(1)245-1,
197(1)246-1,
197(1)246-2,
197(1)247-2,
198(1)201,
206(1)257,
206(1)331,
206(1)353,
212(1)141,
215(1)329,
216(1)271,
216(1)395,
227(1)299,
227(1)333
- propositional,
147(1)149,
155(1)157,
155(1)277,
159(2)343,
161(1)109,
163(1)99,
166(1)1,
166(1)221,
169(2)161,
170(1)129,
171(1)179,
175(1)15,
177(2)381,
179(1)427,
182(1)183,
183(2)187,
186(1)135,
195(1)33,
197(1)245,
198(1)201
- randomization,
157(1)35
- search,
137(2)253,
144(1)101,
144(1)161,
144(1)199,
144(1)251,
146(1)199,
147(1)19,
148(2)325,
154(2)225,
156(1)39,
156(1)315,
163(1)117,
164(1)1,
164(1)141,
164(1)185,
167(1)95,
168(1)21,
172(1)265,
181(1)119,
182(1)217,
188(1)1,
188(1)221,
191(1)229,
203(1)51,
205(1)243,
229(1)103