## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: | Book |
---|---|

All Authors / Contributors: |
Manuel Blum; Rachel Rue; Ke Yang |

OCLC Number: | 50068106 |

Notes: | "March 29, 2002." |

Description: | 29 pages : illustrations ; 28 cm. |

Series Title: | Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-110. |

Responsibility: | Manuel Blum, Rachel Rue, Ke Yang. |

### Abstract:

Abstract: "We study the complexity of a class of circuits, namely, the MAX/MIN/AVRG circuits. On the wires of these circuits are real values between 0 and 1; the functions each gate performs are MAX, MIN, and AVERAGE of fan-in 2; there can be feed-backs in the circuit. It can be shown that every such circuit has at least a 'stable' solution, meaning that there is a way to set each wire to a particular value such that each gate is satisfied. However, finding a stable solution in polynomial time seems to be a tricky problem and remains unsolved. We discuss some results concern [sic] this computation model, as well as its applications."

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "On the complexity of MAX/MIN/AVRG circuits".
Be the first.