Pages that link to "Item:Q1380287"
From MaRDI portal
The following pages link to On estimates on the complexity of restrictions of Boolean functions (Q1380287):
Displaying 13 items.
- On the computational complexity of some classical equivalence relations on boolean functions (Q1272598) (← links)
- On the complexity of balanced Boolean functions (Q1606934) (← links)
- Complexity of activity tests for partial Boolean functions (Q1820131) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- Estimation of the number of variables of Boolean functions of moderate weight containing no implicent of smaller length (Q2852142) (← links)
- Upper Bounds on Boolean-Width with Applications to Exact Algorithms (Q2867092) (← links)
- On the complexity of the evaluation of transient extensions of Boolean functions (Q2909178) (← links)
- Bounds for the number of Boolean functions admitting affine approximations of a given accuracy (Q2997852) (← links)
- On the complexity of restrictions of Boolean functions (Q3125953) (← links)
- On the complexity of Boolean functions with small number of ones (Q3409861) (← links)
- A Gödel Theorem on Network Complexity Lower Bounds (Q3708019) (← links)
- Local complexity of Boolean functions (Q4443562) (← links)
- Lower bounds for the complexity of restrictions of Boolean functions (Q5954083) (← links)