Linear codes are hard for oblivious read-once parity branching programs (Q1606909): Difference between revisions

@@ Property / author @@
-Stasys P. Jukna
@@ Property / author: Stasys P. Jukna / rank @@
-Normal rank
@@ Property / author @@
+Stasys P. Jukna
@@ Property / author: Stasys P. Jukna / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
+Normal rank
@@ Property / cites work @@
+A note on read-$k$ times branching programs
@@ Property / cites work: A note on read-$k$ times branching programs / rank @@
+Normal rank
@@ Property / cites work @@
+Neither reading few bits twice nor reading illegally helps much
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3364203
@@ Property / cites work: Q3364203 / rank @@
+Normal rank
@@ Property / cites work @@
+On the descriptive and algorithmic power of parity ordered binary decision diagrams
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(99)00027-7
+Normal rank
@@ Property / OpenAlex ID @@
+W1998989512
@@ Property / OpenAlex ID: W1998989512 / rank @@
+Normal rank