skip to content
On the complexity of MAX/MIN/AVRG circuits Preview this item
ClosePreview this item
Checking...

On the complexity of MAX/MIN/AVRG circuits

Author: Manuel Blum; Rachel Rue; Ke Yang
Publisher: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2002]
Series: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-110.
Edition/Format:   Book : English
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; 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 p. : ill. ; 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
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/50068106>
library:oclcnum"50068106"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/50068106>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"2002"
schema:description"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.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/6193066>
schema:inLanguage"en"
schema:name"On the complexity of MAX/MIN/AVRG circuits"
schema:numberOfPages"29"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.