Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR97-013 | 13th February 1997 00:00

On Existentially First-Order Definable Languages and their Relation to NP

RSS-Feed




TR97-013
Authors: Bernd Borchert, Dietrich Kuske, Frank Stephan
Publication: 25th April 1997 13:45
Downloads: 1262
Keywords: 


Abstract:

Pin & Weil [PW95] characterized the automata of existentially
first-order definable languages. We will use this result for the following
characterization of the complexity class NP. Assume that the
Polynomial-Time Hierarchy does not collapse. Then a regular language
L characterizes NP as an unbalanced polynomial-time leaf language
if and only if L is existentially but not quantifierfree definable
in FO[<,min,max,-1,+1].



ISSN 1433-8092 | Imprint