skip to content
PP is closed under intersection Preview this item
ClosePreview this item
Checking...

PP is closed under intersection

Author: Richard Beigel; Nick Reingold; Daniel Spielman
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: "In his seminal paper on probabilistic Turing machines, Gill [Gil77] asked whether the class PP is closed under intersection and union. We give a positive answer to this question. In fact, PP is closed under polynomial-time multilinear reductions. In circuits, this allows us to combine several threshold gates into a single threshold gate, while increasing depth by only a constant. Consequences in
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; Nick Reingold; Daniel Spielman
OCLC Number: 25999725
Notes: "June 1990."
Description: 13 pages ; 28 cm.
Series Title: Yale University.; Department of Computer Science.; Technical report
Responsibility: Richard Beigel, Nick Reingold, Daniel Spielman.

Abstract:

Abstract: "In his seminal paper on probabilistic Turing machines, Gill [Gil77] asked whether the class PP is closed under intersection and union. We give a positive answer to this question. In fact, PP is closed under polynomial-time multilinear reductions. In circuits, this allows us to combine several threshold gates into a single threshold gate, while increasing depth by only a constant. Consequences in complexity theory include definite collapse and plausible separation of certain query hierarchies over PP.

Consequences in the study of circuits include the simulation of circuits with a small number of threshold gates by circuits having only a single threshold gate at the root (perceptrons), and a lower bound on the number of threshold gates needed in order to compute the parity function."

Reviews

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

Tags

Be the first.

Similar Items

Related Subjects:(1)

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/25999725>
library:oclcnum"25999725"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1990"
schema:description"Abstract: "In his seminal paper on probabilistic Turing machines, Gill [Gil77] asked whether the class PP is closed under intersection and union. We give a positive answer to this question. In fact, PP is closed under polynomial-time multilinear reductions. In circuits, this allows us to combine several threshold gates into a single threshold gate, while increasing depth by only a constant. Consequences in complexity theory include definite collapse and plausible separation of certain query hierarchies over PP."@en
schema:description"Consequences in the study of circuits include the simulation of circuits with a small number of threshold gates by circuits having only a single threshold gate at the root (perceptrons), and a lower bound on the number of threshold gates needed in order to compute the parity function.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/29116901>
schema:inLanguage"en"
schema:isPartOf
schema:name"PP is closed under intersection"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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