Abstract
It has been conjectured [FSV93] that an existential second-oder formula, in which the second-order quantification is restricted to unary relations (i.e. a Monadic NP formula), cannot express Graph Connectivity even in the presence of arbitrary built-in relations. In this paper it is shown that Graph Connectivity cannot be expressed by Monadic NP formulas in the presence of arbitrary built-in relations of degree no(1) The result is obtained by using a simplified version of a method introduced in [Sch94] that allows the extension of a local winning strategy for Duplicator, one of the two players in Ehrenfcucht games, to a global winning strategy.
Cite
CITATION STYLE
Schwentick, T. (1995). Graph connectivity, monadic NP and built-in relations of moderate degree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 944, pp. 405–416). Springer Verlag. https://doi.org/10.1007/3-540-60084-1_92
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
