Pages that link to "Item:Q3974564"
From MaRDI portal
The following pages link to Some estimates of the complexity of disjunctive normal forms of a random Boolean function (Q3974564):
Displaying 12 items.
- The number of monotone and self-dual Boolean functions. (Q275595) (← links)
- On the frequency of the most frequently occurring variable in dual monotone DNFs (Q1357747) (← links)
- On randomized complexity of functions approximating the majority function (Q2746911) (← links)
- (Q3342372) (← links)
- (Q3691581) (← links)
- (Q3767261) (← links)
- Regular Boolean functions with given complexity of disjunctive normal forms (Q3983323) (← links)
- Boolean Normal Forms, Shellability, and Reliability Computations (Q4490781) (← links)
- On the complexity of the disjunctive normal form of threshold functions (Q4522868) (← links)
- The shortest disjunctive normal form of a random Boolean function (Q4800394) (← links)
- Об алгоритме поиска существенных аргументов случайных булевых функций (Q5152395) (← links)
- A combinatorial method for the evaluation of probabilities of complex Boolean functions (Q5932979) (← links)