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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.