Entry Lincoln:1994:COM 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{Lincoln:1994:COM,
author = "Patrick Lincoln and Timothy Winkler",
title = "Constant-only multiplicative linear logic is
{NP}-complete",
journal = j-THEOR-COMP-SCI,
volume = "135",
number = "1",
pages = "155--169",
day = "05",
month = dec,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:36 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=135&issue=1;
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=135&issue=1&aid=1749",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240C (Computational
complexity)",
conflocation = "Oxford, UK; April 1992",
conftitle = "Mathematical Foundations of Programming Semantics",
corpsource = "Comput. Sci. Lab., SRI Int., Menlo Park, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "classical proof rules of contraction; computational
complexity; constant-only multiplicative linear logic;
encoding; formal logic; multiplicative fragment;
NP-complete; resource-aware logic",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- C4240C,
134(2)263,
134(2)287,
134(2)387,
134(2)403,
134(2)415,
134(2)427,
134(2)473,
134(2)493,
134(2)529,
134(2)545,
134(2)559,
135(1)139,
135(1)z,
135(2)361,
136(2)387,
136(2)419,
136(2)487,
136(2)507
- classical,
73(2)155,
92(1)3,
94(2)295,
94(2)373,
99(2)177,
102(1)207,
105(1)141,
113(2)349,
114(2)317,
115(1)63,
123(1)61,
123(2)291,
123(2)341,
129(1)79,
134(2)329,
135(1)11
- complete, NP-,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(2)361,
120(2)311
- complete, NP-,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(2)361,
120(2)311
- contraction,
76(2)179,
123(2)341
- encoding,
72(1)55,
79(1)151,
86(2)365,
89(1)137,
92(1)213,
94(2)295,
97(1)1,
106(2)337,
129(2)407,
134(1)63,
134(1)189
- fragment,
95(1)115,
101(1)35,
102(1)207,
107(2)253,
123(1)31,
126(1)77,
135(1)139
- multiplicative,
102(1)207,
102(2)307,
117(1)289
- NP-complete,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(2)361
- rule,
71(2)193,
72(2)265,
75(1)45,
75(1)85,
75(1)157,
78(1)85,
80(2)319,
81(2)169,
81(2)223,
81(2)305,
82(2)403,
83(1)97,
84(1)127,
85(2)333,
86(1)107,
87(1)203,
89(1)3,
89(2)207,
93(1)75,
93(1)159,
93(2)321,
94(2)281,
94(2)311,
95(1)43,
98(1)99,
103(2)283,
103(2)409,
104(1)109,
105(1)57,
106(1)61,
109(1)181,
110(2)419,
111(1)125,
111(1)145,
111(1)z,
112(1)99,
112(1)145,
113(2)349,
114(1)149,
116(2)291,
117(1)91,
117(1)113,
119(1)39,
119(1)145,
119(2)355,
120(1)83,
126(2)143,
131(1)95,
131(1)181,
132(1)395,
133(2)361,
133(2)387,
135(1)67