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.

The Complexity of Satisfiability Problems: Refining Schaefer s Theorem

Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer. The Complexity of Satisfiability Problems: Refining Schaefer s Theorem. In Joanna Jedrzejowicz, Andrzej Szepietowski, editors, Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings. Volume 3618 of Lecture Notes in Computer Science, pages 71-82, Springer, 2005. [doi]

Authors

Eric Allender

This author has not been identified. Look up 'Eric Allender' in Google

Michael Bauland

This author has not been identified. Look up 'Michael Bauland' in Google

Neil Immerman

This author has not been identified. Look up 'Neil Immerman' in Google

Henning Schnoor

This author has not been identified. Look up 'Henning Schnoor' in Google

Heribert Vollmer

This author has not been identified. Look up 'Heribert Vollmer' in Google
runs on