home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!usc!cs.utexas.edu!swrinde!elroy.jpl.nasa.gov!ames!pasteur!athos.Berkeley.EDU!luciano
- From: luciano@athos.Berkeley.EDU (Luciano Lavagno)
- Newsgroups: comp.lsi
- Subject: Re: Query : Estimating size of cubes in cube cover.
- Message-ID: <1992Aug17.171221.4588@pasteur.Berkeley.EDU>
- Date: 17 Aug 92 17:12:21 GMT
- References: <9208111010.AA15042@kailash.cse.iitb.ernet.in>
- Sender: nntp@pasteur.Berkeley.EDU (NNTP Poster)
- Reply-To: luciano@athos.Berkeley.EDU (Luciano Lavagno)
- Organization: UC Berkeley IC CAD Group
- Lines: 23
- Nntp-Posting-Host: athos.berkeley.edu
-
- In article <9208111010.AA15042@kailash.cse.iitb.ernet.in>,
- pagey@kailash.cse.iitb.ernet.in (S Pagey) writes:
- >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 sizes of 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.
-
- What do you mean by "sizes of cubes" ? The number of vertices covered by each
- cube ? Moreover, the cover is by no means unique... even if you limit yourself
- to prime and irredundant covers.
- So it seems that I need more information in order to help you...
- Luciano
- P.s. sorry about the delay: I tried to reply by e-mail, but it bounced back
- after a week of fruitless attempts...
- --
- Luciano Lavagno luciano@ic.Berkeley.EDU +1-510-642-5012
- Dept. of EECS, 207-69 Cory Hall, Univ. of California, Berkeley, CA 94720, USA
-