Graph Connectivity, Monadic NP and built-in relations of moderate degree (Q4645196): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-60084-1_92
+Normal rank
@@ Property / OpenAlex ID @@
+W1516182147
@@ Property / OpenAlex ID: W1516182147 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability is harder for directed than for undirected finite graphs
+Normal rank
@@ Property / cites work @@
+\(\Sigma_ 1^ 1\)-formulae on finite structures
@@ Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank @@
+Normal rank
@@ Property / cites work @@
+Second-order and Inductive Definability on Finite Structures
+Normal rank
@@ Property / cites work @@
+Q4023926
@@ Property / cites work: Q4023926 / rank @@
+Normal rank
@@ Property / cites work @@
+An application of games to the completeness problem for formalized theories
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic generalized spectra
@@ Property / cites work: Monadic generalized spectra / rank @@
+Normal rank
@@ Property / cites work @@
+Q3230355
@@ Property / cites work: Q3230355 / rank @@
+Normal rank
@@ Property / cites work @@
+On monadic NP vs monadic co-NP
@@ Property / cites work: On monadic NP vs monadic co-NP / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4645196