On the bottleneck counting argument (Q1566741): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The monotone circuit complexity of Boolean functions
+Normal rank
@@ Property / cites work @@
+Q4726174
@@ Property / cites work: Q4726174 / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric approximation arguments for monotone lower bounds without sunflowers
+Normal rank
@@ Property / cites work @@
+Q4234106
@@ Property / cites work: Q4234106 / rank @@
+Normal rank
@@ Property / cites work @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231908
@@ Property / cites work: Q4231908 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3758729
@@ Property / cites work: Q3758729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(99)00321-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2027898675
@@ Property / OpenAlex ID: W2027898675 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1566741