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]

Authors

Piotr Berman

This author has not been identified. Look up 'Piotr Berman' in Google

Marek Karpinski

This author has not been identified. Look up 'Marek Karpinski' in Google

Alexander D. Scott

This author has not been identified. Look up 'Alexander D. Scott' in Google