This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Algorithm to Dualize a Regular Switching Function
March 1979 (vol. 28 no. 3)
pp. 238-243
P.L. Hammer, Department of Combinatorics and Optimization, University of Waterloo
Given a monotone (nondecreasing) switching function F(x1,???,xn), its prime implicants are the minimal infeasible points, i.e., the minimal solutions to F(x) = 1. A monotone F is regular ifany "right shift" of a feasible point is again feasible. The roofs of a regular function F are those prime implicants al ofwhose right shifts are feasible. The set of these roofs completely
Index Terms:
switching functions, Algorithm, dual, lexicographical ordering, prime implicants, regular, roofs and ceilings
Citation:
P.L. Hammer, U.N. Peled, M.A. Pollatschek, "An Algorithm to Dualize a Regular Switching Function," IEEE Transactions on Computers, vol. 28, no. 3, pp. 238-243, March 1979, doi:10.1109/TC.1979.1675324
Usage of this product signifies your acceptance of the Terms of Use.