skip to content
On ACC Preview this item
ClosePreview this item
Checking...

On ACC

Author: Richard Beigel
Publisher: New Haven, Conn. : Yale University, Dept. of Computer Science, [1990]
Series: Yale University.; Department of Computer Science.; Technical report
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "Building on work of Toda [7] and Allender [1], Yao [9] has shown that every language in ACC is accepted by a family of depth-2 probabilistic circuits with a symmetric gate at the root and AND gates of small fanin at the next level. We simplify Yao's proof, and improve one of Toda's underlying technical results."
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: Richard Beigel
OCLC Number: 25999711
Notes: "September 21, 1990."
Description: 8 pages ; 28 cm.
Series Title: Yale University.; Department of Computer Science.; Technical report
Responsibility: Richard Beigel.

Abstract:

Abstract: "Building on work of Toda [7] and Allender [1], Yao [9] has shown that every language in ACC is accepted by a family of depth-2 probabilistic circuits with a symmetric gate at the root and AND gates of small fanin at the next level. We simplify Yao's proof, and improve one of Toda's underlying technical results."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(2)

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/25999711>
library:oclcnum"25999711"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/25999711>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:creator
schema:datePublished"1990"
schema:description"Abstract: "Building on work of Toda [7] and Allender [1], Yao [9] has shown that every language in ACC is accepted by a family of depth-2 probabilistic circuits with a symmetric gate at the root and AND gates of small fanin at the next level. We simplify Yao's proof, and improve one of Toda's underlying technical results.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/29116622>
schema:inLanguage"en"
schema:name"On ACC"@en
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.