The Minimal Logically-Defined NP-Complete ProblemReport as inadecuate

The Minimal Logically-Defined NP-Complete Problem - Download this document for free, or read online. Document in PDF available to download.

1 GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen

Abstract : We present an NP complete defined by an existential monadic second order formula over functional structures that : 1 is minimal under several syntactic criteria 2 is unique for such restrictions, up to renamings and symmetries ; our reductions and proofs are surprisingly very elementary and simple in comparison with some recent similar results classifying existential second-order formulas over relational structures according to their ability either to express NP complete problems only PTIME ones

Author: Régis Barbanchon - Etienne Grandjean -



Related documents