A proof of Beigel's cardinality conjecture (Q4032650): 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.2307/2275299
@@ Property / full work available at URL: https://doi.org/10.2307/2275299 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2160493389
@@ Property / OpenAlex ID: W2160493389 / rank @@
+Normal rank
@@ Property / cites work @@
+Bi-immunity results for cheatable sets
@@ Property / cites work: Bi-immunity results for cheatable sets / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial terse sets
@@ Property / cites work: Polynomial terse sets / rank @@
+Normal rank
@@ Property / cites work @@
+A cardinality version of Beigel's nonspeedup theorem
+Normal rank
@@ Property / cites work @@
+Bounded query classes and the difference hierarchy
+Normal rank
@@ Property / cites work @@
+Frequency computations and the cardinality theorem
+Normal rank
@@ Property / cites work @@
+A generalization of Ramsey's theorem for regular trees
+Normal rank