Graph Connectivity, Monadic NP and built-in relations of moderate degree
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 405-416
- https://doi.org/10.1007/3-540-60084-1_92
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Logical reducibility and monadic NPPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Graph connectivity and monadic NPPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Reachability is harder for directed than for undirected finite graphsThe Journal of Symbolic Logic, 1990
- Second-order and Inductive Definability on Finite StructuresMathematical Logic Quarterly, 1987
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983
- Monadic generalized spectraMathematical Logic Quarterly, 1975
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960