Cancellation-free circuits in unbounded and bounded depth (Q2348031): Difference between revisions

@@ Property / author @@
-Joan. Boyar
@@ Property / author: Joan. Boyar / rank @@
-Normal rank
@@ Property / author @@
+Joan. Boyar
@@ Property / author: Joan. Boyar / 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.tcs.2014.10.014
+Normal rank
@@ Property / OpenAlex ID @@
+W1888922747
@@ Property / OpenAlex ID: W1888922747 / rank @@
+Normal rank
@@ Property / cites work @@
+Cancellation-Free Circuits in Unbounded and Bounded Depth
+Normal rank
@@ Property / cites work @@
+Logic minimization techniques with applications to cryptology
+Normal rank
@@ Property / cites work @@
+Q3115280
@@ Property / cites work: Q3115280 / rank @@
+Normal rank
@@ Property / cites work @@
+Disproving the Single Level Conjecture
@@ Property / cites work: Disproving the Single Level Conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Linear Boolean Operators
@@ Property / cites work: Complexity of Linear Boolean Operators / rank @@
+Normal rank
@@ Property / cites work @@
+Computational aspects of the Mobius transformation of graphs
+Normal rank
@@ Property / cites work @@
+Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
+Normal rank
@@ Property / cites work @@
+On the Evaluation of Powers and Monomials
@@ Property / cites work: On the Evaluation of Powers and Monomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5601762
@@ Property / cites work: Q5601762 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3236503
@@ Property / cites work: Q3236503 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean function complexity. Advances and frontiers.
+Normal rank
@@ Property / cites work @@
+Q5591914
@@ Property / cites work: Q5591914 / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on Boolean sums
@@ Property / cites work: Some remarks on Boolean sums / rank @@
+Normal rank
@@ Property / cites work @@
+On another Boolean matrix
@@ Property / cites work: On another Boolean matrix / rank @@
+Normal rank
@@ Property / cites work @@
+A new lower bound on the monotone network complexity of Boolean sums
+Normal rank
@@ Property / cites work @@
+Linear Circuits over $\operatorname{GF}(2)$
@@ Property / cites work: Linear Circuits over $\operatorname{GF}(2)$ / rank @@
+Normal rank
@@ Property / cites work @@
+Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
+Normal rank
@@ Property / cites work @@
+Q4331740
@@ Property / cites work: Q4331740 / rank @@
+Normal rank
@@ Property / cites work @@
+Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On a problem of K. Zarankiewicz
@@ Property / cites work: On a problem of K. Zarankiewicz / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255576
@@ Property / cites work: Q4255576 / rank @@
+Normal rank
@@ Property / cites work @@
+A Very Compact S-Box for AES
@@ Property / cites work: A Very Compact S-Box for AES / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474178
@@ Property / cites work: Q4474178 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2348031