External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Complexity and Algorithms for Well-Structured k-SAT Instances

Konstantinos Georgiou, Periklis A. Papakonstantinou. Complexity and Algorithms for Well-Structured k-SAT Instances. In Hans Kleine Büning, Xishun Zhao, editors, Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings. Volume 4996 of Lecture Notes in Computer Science, pages 105-118, Springer, 2008. [doi]

Authors

Konstantinos Georgiou

This author has not been identified. Look up 'Konstantinos Georgiou' in Google

Periklis A. Papakonstantinou

This author has not been identified. Look up 'Periklis A. Papakonstantinou' in Google
runs on