This paper describes a fast and efficient method for minimization of two level single output Boolean functions.The minimization problem is reduced to that of coloring of the graph of incompatibility of implicanm.The program permits also to remove static hazards and allows inversion of output's polarity which proves to be very convenient when designing with PAL's, It gives solutions within a very reasonable amount of time.On small industrial examples its speed is slightly better than Espresso and it occupies 6 times less memory.

No abstract

No abstract

No abstract