Regular ArticleOn the Complexity of k-SAT
Under an Elsevier user license
open archive
Cited by (0)
- 1
This research is supported by NSF Grant CCR-9734911 from the Theory of Computing Program and INT-9600919/ME103 of the NSF and Czech Republic of Education.
- 2
This research is supported by NSF Grant CCR-9734911 from the Theory of Computing Program.
Copyright © 2001 Academic Press. All rights reserved.