More on the complexity of slice functions (Q1079365): 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.1016/0304-3975(86)90176-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2001924771
@@ Property / OpenAlex ID: W2001924771 / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting in \(c \log n\) parallel steps
@@ Property / cites work: Sorting in \(c \log n\) parallel steps / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5656695
@@ Property / cites work: Q5656695 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on monotone complexity of the logical permanent
+Normal rank
@@ Property / cites work @@
+Q4138141
@@ Property / cites work: Q4138141 / rank @@
+Normal rank
@@ Property / cites work @@
+Negation is Powerless for Boolean Slice Functions
@@ Property / cites work: Negation is Powerless for Boolean Slice Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
+Normal rank
@@ Property / cites work @@
+On the complexity of slice functions
@@ Property / cites work: On the complexity of slice functions / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1079365