文章基本信息

标题：On Existentially First-Order Definable Languages and their Relation to NP
本地全文：下载
作者：Bernd Borchert ; Dietrich Kuske ; Frank Stephan 等
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：1997
卷号：1997
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：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].
关键词：definable languages, leaf languages, NP