Entry Arvind:1989:SBR from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Arvind:1989:SBR,
author = "V. Arvind and S. Biswas",
title = "On some bandwidth restricted versions of the
satisfiability problem of propositional {CNF}
formulas",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "2",
pages = "123--134",
day = "30",
month = oct,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
conflocation = "Pune, India; 17-19 Dec. 1987",
conftitle = "Seventh Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of
Technol., Delhi, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bandwidth restricted versions; complexity;
computational complexity; corresponding languages;
decision problems; formal logic; kernel
constructibility; logics; proof; propositional CNF
formulas; satisfiability problem; satisfiable
propositional CNF formulas; self-reducibility property;
Turing machine acceptance problems; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- acceptance,
61(2)137
- bandwidth,
41(2)141,
58(1)209
- constructibility,
35(2)215
- decision,
38(1)69,
41(2)247,
43(1)81,
44(2)237,
47(1)39,
49(2)217,
53(1)67,
53(2)307,
54(2)215,
56(3)289,
58(1)155,
59(3)287,
67(2)143,
68(3)319,
68(3)343
- formula,
38(2)307,
38(2)343,
39(2)155,
41(2)271,
46(1)91,
49(1)1,
52(3)281,
54(2)165,
57(1)97,
58(1)347,
59(1)115,
61(2)307,
62(3)311,
65(2)153,
66(1)113,
68(1)113
- kernel,
42(2)123,
47(1)39
- proof,
35(2)345,
36(2)251,
39(1)27,
39(1)47,
39(1)z,
41(1)121,
42(2)123,
43(1)91,
43(2)345,
44(2)127,
44(3)333,
46(2)261,
46(2)305,
48(2)229,
50(3)241,
52(3)239,
52(3)281,
54(2)199,
57(2)161,
57(2)317,
59(3)317,
61(2)225,
62(3)311,
63(1)91,
65(1)1,
65(1)35,
65(2)149,
66(1)87,
67(1)87,
67(2)203,
68(3)267,
68(3)333,
69(1)69,
69(3)243
- property,
35(1)109,
35(2)295,
35(2)337,
36(2)217,
36(2)291,
37(1)77,
37(3)305,
38(1)35,
39(1)3,
39(1)z,
39(2)123,
39(2)189,
39(2)281,
39(2)337,
40(2)163,
40(2)211,
40(2)257,
41(2)215,
43(2)277,
43(2)315,
44(1)51,
44(2)127,
46(1)83,
46(2)141,
46(2)175,
46(2)313,
48(1)53,
48(1)75,
49(1)1,
49(1)23,
49(1)43,
51(3)281,
52(1)15,
52(1)165,
52(3)205,
53(1)99,
56(1)3,
57(1)87,
57(2)225,
61(2)103,
61(2)199,
61(2)259,
61(2)283,
62(1)123,
62(3)267,
63(1)43,
63(3)303,
63(3)333,
64(1)83,
64(2)191,
64(3)281,
65(2)197,
65(2)221,
65(2)z,
67(1)121,
68(1)1,
68(3)333
- propositional,
36(1)71,
38(2)343,
39(2)297,
49(2)217,
55(1)1,
59(1)115,
61(2)259,
62(3)311,
66(1)87,
68(1)113
- restricted,
35(2)129,
47(3)335,
52(3)341
- satisfiability,
38(2)343,
40(2)195,
52(1)145,
61(2)307,
67(2)303,
68(1)113
- Turing,
35(2)191,
35(2)215,
36(2)341,
37(1)1,
40(2)175,
41(2)331,
43(1)43,
43(1)107,
44(1)1,
44(1)111,
47(2)131,
47(3)237,
51(3)265,
52(1)15,
52(3)251,
52(3)341,
53(2)307,
54(2)325,
54(2)331,
55(2)291,
57(1)47,
58(1)175,
58(1)263,
61(2)149,
66(3)289,
67(1)5,
67(1)99,
68(1)19
- version,
38(1)17,
61(1)25,
65(3)343