Pages that link to "Item:Q2892023"
From MaRDI portal
The following pages link to Computational complexity of Boolean functions (Q2892023):
Displaying 15 items.
- Totally optimal decision trees for Boolean functions (Q323025) (← links)
- The complexity of Boolean functions in different characteristics (Q626677) (← links)
- On estimates on the complexity of restrictions of Boolean functions (Q1380287) (← links)
- On implementation of Boolean functions by contact circuits with a constant uniform width (Q2243824) (← links)
- Complexity of sequential implementation of partial Boolean functions (Q2377493) (← links)
- On implementation of Boolean functions by contact circuits of minimal uniform width (Q2685505) (← links)
- (Q3762226) (← links)
- Complexity of realization of symmetric Boolean functions by switching circuits (Q3980810) (← links)
- The complexity of Boolean networks (Q3994882) (← links)
- Algorithms for Boolean Function Query Properties (Q4429679) (← links)
- Local complexity of Boolean functions (Q4443562) (← links)
- Monotone Boolean functions (Q4829648) (← links)
- Boolean complexity classes vs. their arithmetic analogs (Q4894604) (← links)
- Complexity of Linear Boolean Operators (Q5396765) (← links)
- Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms (Q5413210) (← links)