Pages that link to "Item:Q1407293"
From MaRDI portal
The following pages link to On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials (Q1407293):
Displaying 6 items.
- Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (Q895458) (← links)
- Deterministic polynomial identity testing in non-commutative models (Q1781113) (← links)
- Development of the methods of Boolean differential calculus for arithmetic logic (Q1914366) (← links)
- (Q3074627) (← links)
- On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials (Q4522714) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)