Pages that link to "Item:Q895458"
From MaRDI portal
The following pages link to Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (Q895458):
Displaying 6 items.
- On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials (Q1407293) (← links)
- Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- (Q3783560) (← links)
- (Q4218113) (← links)
- Explicit lower bound of <i>4.5n - o(n)</i> for boolena circuits (Q5175995) (← links)
