The following pages link to (Q3691581):
Displaying 15 items.
- Shortest and minimal disjunctive normal forms of complete functions (Q500624) (← links)
- Sphere coverings of the hypercube with incomparable centers (Q1813996) (← links)
- Boolean function minimization in the class of disjunctive normal forms (Q1825217) (← links)
- On randomized complexity of functions approximating the majority function (Q2746911) (← links)
- (Q3342372) (← links)
- Approximating Boolean Functions with Depth-2 Circuits (Q3451753) (← links)
- Representations of Boolean functions by systems of linear inequalities (Q3744091) (← links)
- (Q3767261) (← links)
- Some estimates of the complexity of disjunctive normal forms of a random Boolean function (Q3974564) (← links)
- Regular Boolean functions with given complexity of disjunctive normal forms (Q3983323) (← links)
- Estimating the efficiency of threshold representations of Boolean functions (Q4005316) (← links)
- On the complexity of the disjunctive normal form of threshold functions (Q4522868) (← links)
- The number of Boolean functions computed by formulas of a given size (Q4705331) (← links)
- The shortest disjunctive normal form of a random Boolean function (Q4800394) (← links)
- Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms (Q5413210) (← links)
