Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
For any two n-bit numbers a≤b define the Boolean function f[a,b]:{0,1}n→{0,1} to be the function for which fa,b=1 if and only if x is the binary representation of a number in the interval [a,b]. We consider the disjunctive normal form representation of such functions, and show how to compute such a representation with a minimum number of disjuncts in linear time. We also show how to compute a minimum "disjoint" representation; i.e., a representation in which the domains of the disjuncts are mutually disjoint. The minimum disjunctive normal form can be applied to devise efficient constraint satisfaction systems for automatic generation of test patterns. © 2005 Elsevier B.V. All rights reserved.
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering