🚀 go-pugleaf

Some time back I had posted this newsitem on the net. But unfortunately some
problem developed in the newsfeed here and no news was coming to us. Because of
this problem I must have lost all the responses to this item. I am posting it
again. Please post your responses again. If, by chance, someone has collected
responses to this item, please mail them to me.

The basic technique used in two level minimization of single output Boolean
functions is to find a cube cover of smallest size. My querry is about the
estimation of the size of the cubes in the cube cover. The querry is,

Given the assignment of 0, 1, and X (don't cares) to the vertices, how to
estimate sizes of cubes in the cube cover, without actually finding the cube
cover? Are any bounds known on the sizes of cubes in cube cover? The cube cover
referred to here is same as the cube cover for two level minimization of
Boolean functions. 

Any references are welcome.
Thanks in advance.
-------------------------------------------------------------------------
Sandeep Pagey,
Dept. of Computer Sc. and Engg.,
IIT Powai,
Bombay 400 076. INDIA.
email : pagey@cse.iitb.ernet.in
-------------------------------------------------------------------------