Entry Mayer:1996:CPI 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{Mayer:1996:CPI,
author = "Alain J. Mayer and Larry J. Stockmeyer",
title = "The complexity of {PDL} with interleaving",
journal = j-THEOR-COMP-SCI,
volume = "161",
number = "1--2",
pages = "109--122",
day = "15",
month = jul,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:03 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-2;
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=1996&volume=161&issue=1-2&aid=2036",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240C (Computational
complexity); C4240P (Parallel programming and algorithm
theory)",
corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computability; computational complexity;
concurrently executing programs; formal logic;
interleaving; parallel programming; PDL; propositional
dynamic logic; satisfiability problem",
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)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,
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
- concurrently,
194(1)248-1
- dynamic,
138(1)211,
140(2)205,
140(2)319,
142(1)59,
144(1)125,
151(1)125,
158(1)233,
162(2)341,
164(1)165,
165(2)407,
165(2)441,
166(1)173,
167(1)235,
168(2)461,
169(2)161,
174(1)203,
175(2)225,
184(1)195,
186(1)199,
190(2)115,
192(2)201,
194(1)242-1,
195(1)3,
199(1)145,
216(1)109,
217(1)157,
229(1)41
- interleaving,
154(1)107,
155(1)39,
170(1)297,
196(1)365,
198(1)159,
206(1)219
- PDL,
166(1)173
- propositional,
147(1)149,
155(1)157,
155(1)277,
159(2)343,
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,
197(1)245-2,
198(1)201
- satisfiability,
137(1)129,
139(1)1,
145(1)111,
146(1)243,
150(1)1,
155(1)277,
160(1)365,
165(1)133,
166(1)147,
170(1)1,
171(1)3,
172(1)233,
175(2)349,
181(1)195,
184(1)195,
191(1)145,
193(1)149,
195(2)183