New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778): Difference between revisions

@@ Property / author @@
+Evgeny Demenkov
@@ Property / author: Evgeny Demenkov / rank @@
+Normal rank
@@ Property / author @@
+Arist Kojevnikov
@@ Property / author: Arist Kojevnikov / rank @@
+Normal rank
@@ Property / author @@
+Alexander S. Kulikov
@@ Property / author: Alexander S. Kulikov / rank @@
+Normal rank
@@ Property / author @@
+Grigory Yaroslavtsev
@@ Property / author: Grigory Yaroslavtsev / rank @@
+Normal rank
@@ 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/j.ipl.2010.01.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2009341260
@@ Property / OpenAlex ID: W2009341260 / rank @@
+Normal rank
@@ Property / cites work @@
+A Boolean function requiring 3n network size
@@ Property / cites work: A Boolean function requiring 3n network size / rank @@
+Normal rank
@@ Property / cites work @@
+On the combinational complexity of certain symmetric Boolean functions
+Normal rank
@@ Property / cites work @@
+Q4708583
@@ Property / cites work: Q4708583 / rank @@
+Normal rank
@@ Property / cites work @@
+A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:991778