Results 161 to 170 of about 1,765 (205)
The shortest disjunctive normal form of a random Boolean function
Random Structures and Algorithms, 2003 AbstractThis paper gives a new upper bound for the average length ℓ(n) of the shortest disjunctive normal form for a random Boolean function of n arguments, as well as new proofs of two old results related to this quantity. We consider a random Boolean function of n arguments to be uniformly distributed over all 2 such functions. (This is equivalent to
Nicholas Pippenger
exaly +4 more sources
KeyNote Policy Files and Conversion to Disjunctive Normal Form for Use in IPsec [PDF]
, 2002 We describe a utility for converting a KeyNote policy file to Disjunctive Normal Form, so that it can be further utilized in our research on Quality of Security Service for IPsec.
Evdoxia Spyropoulou +2 more
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Length of prime disjunctive normal forms
Mathematical Notes, 1967The author presents an example of a Logical function of n variables that has a prime disjunctive normal form that asymptotically contains 2n terms. Bibliography of 2 references.
V V Glagolev, Glagolev V V
exaly +3 more sources
Duality and pseudo duality of dual disjunctive normal forms
Knowledge-Based Systems, 2011The paper introduces the concepts of dual disjunctive normal forms in classical logic and fuzzy logics with involution negation. The laws of their truth values are studied. One is called duality, the other is called pseudo duality. Dual disjunctive normal forms in classical logic hold duality, and dual disjunctive normal forms in fuzzy logics with ...
Xingfang Zhang
exaly +2 more sources
Minimal Disjunctive Normal Forms
, 1989 The optimization of Boolean functions is a wide field. One of the few regions where results have achieved a definite appraisal is the minimization of DNFs. Primarily developed for switching circuit synthesis, it has become of some importance also in fault tree analysis (in reliability theory).
Winfrid G. Schneeweiß
openalex +2 more sources
On the Complexity of Dualization of Monotone Disjunctive Normal Forms
Journal of Algorithms, 1996Summary: We show that the duality of a pair of monotone disjunctive normal forms of size \(n\) can be tested in \(n^{o(\log n)}\) time.
Michael L. Fredman, Leonid Khachiyan
openaire +2 more sources
Detection of Disjunctive Normal Form Predicate in Distributed Systems
, 2007 Predicate detection in a distributed system is an important problem. It is useful in debugging and testing of the distributed system. Two modalities are introduced for predicate detection by Cooper and Marzullo. They are denoted by Possibly and Definitely.
Hongtao Huang
openalex +2 more sources