Last update: Thu Sep 27 02:46:57 MDT 2018
@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",
}