Pages that link to "Item:Q808253"
From MaRDI portal
The following pages link to The conjunctive complexity of quadratic Boolean functions (Q808253):
Displaying 7 items.
- Minimal polynomials for the conjunction of functions on disjoint variables can be very simple (Q1823964) (← links)
- Quadratic sequential computations of Boolean mappings (Q1882535) (← links)
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461) (← links)
- The monotone circuit complexity of quadratic Boolean functions (Q2509028) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions (Q5447509) (← links)
- Algorithms and Computation (Q5712145) (← links)