ECCC-Report TR97-013https://eccc.weizmann.ac.il/report/1997/013Comments and Revisions published for TR97-013en-usFri, 25 Apr 1997 13:45:09 +0300
Paper TR97-013
| On Existentially First-Order Definable Languages and their Relation to NP |
Bernd Borchert,
Dietrich Kuske,
Frank Stephan
https://eccc.weizmann.ac.il/report/1997/013Pin & 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].
Fri, 25 Apr 1997 13:45:09 +0300https://eccc.weizmann.ac.il/report/1997/013