Pages that link to "Item:Q891988"
From MaRDI portal
The following pages link to Lower bounds on the formula complexity of a linear Boolean function (Q891988):
Displaying 11 items.
- Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159) (← links)
- Formula complexity of a linear function in a \(k\)-ary basis (Q2037681) (← links)
- Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions (Q3186844) (← links)
- (Q3335688) (← links)
- (Q3822100) (← links)
- Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes (Q4558295) (← links)
- On the complexity of computing a random Boolean function over the reals (Q5140843) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)
- Complexity of Linear Boolean Operators (Q5396765) (← links)
- (Q5878634) (← links)
- On the structure of one class of perfect \(\Pi \)-partitions (Q6587479) (← links)