Pages that link to "Item:Q1350754"
From MaRDI portal
The following pages link to Complexity of Boolean functions over bases with unbounded fan-in gates (Q1350754):
Displaying 10 items.
- Asymptotically best method for synthesis of Boolean recursive circuits (Q783110) (← links)
- Asymptotically best synthesis methods for reflexive-recursive circuits (Q830987) (← links)
- The complexity of the parity function in unbounded fan-in, unbounded depth circuits (Q1183575) (← links)
- General upper bound of circuit complexity in an arbitrary infinite complete base (Q1275996) (← links)
- Multilevel representation and complexity of circuits of unbounded fan-in gates (Q2027864) (← links)
- Ways of synthesizing binary programs admitting recursive call of procedures (Q2058706) (← 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)
- (Q5091223) (← links)
- On the extension complexity of polytopes separating subsets of the Boolean cube (Q6156096) (← links)