Pages that link to "Item:Q1345680"
From MaRDI portal
The following pages link to On the complexity of realizing the powers of a Boolean \((n,n)\)-function (Q1345680):
Displaying 5 items.
- Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (Q895458) (← links)
- On the complexity of implementation of characteristic functions of the spheres by circuits of functional elements (Q2088735) (← links)
- The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200) (← links)
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates (Q2332856) (← links)
- (Q3773338) (← links)