### Abstract

Probability expressions (P-Exps) can be used to represent logical functions. This representation has a variety of practical applications in that it provides a computational saving in certain classes of problems. This paper presents some computational aspects of P-exps. Computational complexity and results on the lengths of P-exps are presented. Operations of P-exps such as solution of P-exps and inversion of P-exps to equivalent Boolean expressions are discussed.

Original language | English (US) |
---|---|

Pages | 650-652 |

Number of pages | 3 |

State | Published - Dec 1 1984 |

Externally published | Yes |

### ASJC Scopus subject areas

- Engineering(all)

## Fingerprint Dive into the research topics of 'ON THE COMPLEXITY AND MANIPULATIONS OF PROBABILITY EXPRESSIONS.'. Together they form a unique fingerprint.

## Cite this

Debany, W. H., Varshney, P. K., & Hartmann, C. R. P. (1984).

*ON THE COMPLEXITY AND MANIPULATIONS OF PROBABILITY EXPRESSIONS.*. 650-652.