The Minimal Logically-Defined NP-Complete Problem

RĂ©gis Barbanchon, Etienne Grandjean. The Minimal Logically-Defined NP-Complete Problem. In Volker Diekert, Michel Habib, editors, STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings. Volume 2996 of Lecture Notes in Computer Science, pages 338-349, Springer, 2004. [doi]

Abstract

Abstract is missing.