Pages that link to "Item:Q1223937"
From MaRDI portal
The following pages link to A class of Boolean functions with linear combinational complexity (Q1223937):
Displaying 7 items.
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (Q895458) (← links)
- Linear lower bounds on unbounded fan-in Boolean circuits (Q1068792) (← links)
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). (Q1811103) (← links)
- On the combinational complexity of certain symmetric Boolean functions (Q4146674) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q5096789) (← links)
