Entry Chlebus:1982:CCS from tcs1980.bib
Last update: Thu Sep 27 02:46:46 MDT 2018
Top |
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{Chlebus:1982:CCS,
author = "B. S. Chlebus",
title = "On the computational complexity of satisfiability in
propositional logics of programs",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "2",
pages = "179--212",
month = nov,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternating Turing machines; computational complexity;
formal logic; polynomial space; programs; propositional
algorithmic logic; propositional dynamic logic;
satisfiability; satisfiability problems; space
complexity; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- algorithmic,
12(1)61,
15(2)201,
18(1)1,
21(3)269,
22(1)71,
32(1)61
- alternating,
11(1)71,
27(1)61,
32(3)321
- computational,
10(1)1,
10(1)53,
10(1)83,
10(2)171,
10(3)221,
11(1)1,
11(1)71,
11(1)93,
11(3)321,
12(1)97,
12(2)119,
12(2)161,
12(3)255,
12(3)291,
13(3)271,
13(3)295,
14(1)1,
14(1)91,
14(3)227,
14(3)247,
14(3)289,
14(3)337,
15(1)77,
15(2)181,
15(2)201,
15(3)291,
15(3)321,
16(1)25,
16(1)99,
16(2)115,
16(3)279,
17(1)55,
17(2)213,
17(3)303,
18(1)95,
18(1)105,
18(3)259,
19(1)1,
19(1)17,
19(1)39,
19(2)161,
19(2)203,
19(3)337,
20(3)323,
21(1)1,
21(1)105,
21(3)255,
22(1)19,
22(1)195,
22(3)285,
22(3)317,
23(2)171,
23(2)187,
23(3)333,
24(2)123,
24(3)221,
24(3)239,
24(3)279,
24(3)291,
25(2)95,
25(2)193,
26(1)197,
26(3)287,
26(3)327,
27(1)3,
27(3)241,
28(1)111,
28(1)135,
28(3)277,
29(1)123,
30(3)241,
30(3)319,
31(1)41,
31(1)101,
31(1)125,
31(1)175,
32(1)61,
32(1)77,
32(1)157,
32(1)173,
32(1)221,
32(3)227,
32(3)279,
33(1)117,
33(2)261,
33(2)305,
34(1)17,
34(1)83,
34(1)207,
34(3)337
- dynamic,
12(1)61,
13(3)331,
14(1)113,
16(3)321,
17(2)193,
17(3)259,
17(3)343,
18(3)301,
21(2)145,
27(1)127,
27(1)197,
27(3)333
- polynomial,
10(1)1,
10(1)53,
10(2)111,
11(1)93,
11(3)321,
11(3)331,
11(3)337,
12(1)1,
12(2)161,
12(3)303,
13(3)271,
14(1)91,
14(3)289,
15(1)27,
15(1)77,
15(3)251,
15(3)279,
15(3)329,
16(2)223,
17(1)91,
17(2)163,
18(1)95,
19(1)17,
19(3)287,
21(1)99,
21(1)105,
21(3)255,
22(1)195,
22(3)285,
22(3)317,
23(1)95,
24(3)291,
25(1)67,
26(1)25,
27(1)3,
27(1)127,
28(1)135,
31(1)101,
31(1)125,
31(3)227,
32(1)61,
32(3)279,
34(1)17,
34(1)207
- program,
11(2)181,
12(1)1,
12(1)61,
13(1)3,
13(1)45,
13(2)175,
13(2)193,
13(3)239,
13(3)315,
15(1)1,
15(2)159,
15(3)223,
15(3)291,
16(2)149,
16(2)199,
16(2)223,
16(3)321,
17(1)55,
17(2)113,
17(2)163,
17(2)193,
17(3)235,
17(3)259,
18(1)41,
18(2)149,
18(3)301,
19(2)203,
20(1)3,
20(2)95,
21(2)231,
21(3)341,
22(1)135,
23(2)187,
24(1)35,
24(2)131,
24(3)221,
25(1)1,
25(2)193,
26(1)121,
27(1)127,
27(1)225,
27(3)297,
28(1)83,
28(1)111,
29(1)185,
30(1)1,
30(1)49,
30(2)139,
30(3)241,
31(1)13,
31(1)175,
33(1)65,
34(1)227
- propositional,
11(3)341,
14(1)113,
16(3)321,
26(1)149,
27(1)127,
27(3)333,
28(1)235
- satisfiability,
12(3)291,
30(3)319
- space,
15(3)311,
16(1)5,
16(2)115,
16(3)329,
17(2)229,
19(2)161,
20(3)323,
21(1)105,
21(3)237,
23(1)95,
23(2)107,
26(1)25,
26(1)197,
27(1)109,
27(1)127,
29(1)155,
31(3)297,
32(1)77,
32(1)221,
34(3)275
- Turing,
10(3)221,
10(3)249,
12(2)161,
12(3)333,
13(3)315,
14(1)91,
15(3)311,
16(1)75,
17(2)229,
19(2)161,
19(3)253,
21(2)145,
21(2)213,
21(3)237,
21(3)255,
23(1)37,
23(3)287,
23(3)333,
24(1)105,
24(2)123,
24(3)331,
26(1)25,
26(1)197,
26(3)327,
27(1)61,
28(1)1,
29(1)123,
31(1)101,
32(1)221,
32(3)227,
34(1)17,
34(1)157