Graph connectivity, monadic NP and built-in relations of moderate degree
From MaRDI portal
Publication:4645196
Recommendations
Cites work
- scientific article; zbMATH DE number 3115890 (Why is no real title available?)
- scientific article; zbMATH DE number 108465 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- An application of games to the completeness problem for formalized theories
- Monadic generalized spectra
- On monadic NP vs monadic co-NP
- Reachability is harder for directed than for undirected finite graphs
- Second-order and Inductive Definability on Finite Structures
- \(\Sigma_ 1^ 1\)-formulae on finite structures
Cited in
(6)
This page was built for publication: Graph connectivity, monadic NP and built-in relations of moderate degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645196)