Computational Complexity of Some Restricted Instances of 3SAT

Piotr Berman, Marek Karpinski, Alexander D. Scott. Computational Complexity of Some Restricted Instances of 3SAT. Electronic Colloquium on Computational Complexity (ECCC), (111), 2004. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: