Name
Abstract | ||
|---|---|---|
The average number of prime k-cubes and essential k-cubes in an n-variable, single-output Boolean function has already been obtained combinationally. The authors show how the same quantities can be obtained geometrically, using the theory of random clumping and take an initial step in calculating, for k-cubes in the minimized form of a function. The authors compare their results to minimizations produced by ESPRESSO and a cruder algorithm. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1109/12.21151 | Computers, IEEE Transactions |
Keywords | Field | DocType |
random clumping,essential k-cubes,initial step,prime k-cubes,single-output boolean function,average number,cruder algorithm,random boolean functions,astronomy,boolean functions,espresso,process design,hypercubes,hardware,physics,boolean function,minimisation | Maximum satisfiability problem,Boolean function,Discrete mathematics,Boolean circuit,Boolean algebras canonically defined,Parity function,Product term,Quine–McCluskey algorithm,Boolean expression,Mathematics | Journal |
Volume | Issue | ISSN |
38 | 4 | 0018-9340 |
Citations | PageRank | References |
1 | 0.38 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Harold Fleisher | 1 | 98 | 50.37 |
| Giraldi, J. | 2 | 1 | 0.38 |
| Phoenix, R. | 3 | 1 | 0.38 |
| Tavel, M. | 4 | 14 | 2.22 |