Binary search and recursive graph problems (Q1391302): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Effective coloration
@@ Property / cites work: Effective coloration / rank @@
+Normal rank
@@ Property / cites work @@
+Unbounded Searching Algorithms
@@ Property / cites work: Unbounded Searching Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
+Normal rank
@@ Property / cites work @@
+On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
+Normal rank
@@ Property / cites work @@
+Terse, superterse, and verbose sets
@@ Property / cites work: Terse, superterse, and verbose sets / rank @@
+Normal rank
@@ Property / cites work @@
+An almost optimal algorithm for unbounded searching
+Normal rank
@@ Property / cites work @@
+Q5595624
@@ Property / cites work: Q5595624 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3901467
@@ Property / cites work: Q3901467 / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of Beigel's cardinality conjecture
@@ Property / cites work: A proof of Beigel's cardinality conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Effective Matchmaking and k-Chromatic Graphs
@@ Property / cites work: Effective Matchmaking and k-Chromatic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Recursively enumerable sets and degrees
@@ Property / cites work: Recursively enumerable sets and degrees / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1391302