Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Galil:1977:CRR,
author = "Z. Galil",
title = "On the complexity of regular resolution and the
{{Davis--Putnam}} procedure",
journal = j-THEOR-COMP-SCI,
volume = "4",
number = "1",
pages = "23--46",
month = feb,
year = "1977",
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/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., IBM Thomas J. Watson Res. Centre,
Yorktown Heights, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean; Boolean algebra; complexity; computational
complexity; Davis Putnam procedure; regular
resolution",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}