skip to content
Polynomial interpolation, threshold circuits, and the polynomial hierarchy Preview this item
ClosePreview this item
Checking...

Polynomial interpolation, threshold circuits, and the polynomial hierarchy

Author: Richard Beigel
Publisher: New Haven, Conn. : Yale University, Dept. of Computer Science, [1991]
Series: Yale University.; Department of Computer Science.; Technical report
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "Toda [13] has shown that the polynomial hierarchy is contained in P[superscript PP]. It is natural to ask whether the polynomial hierarchy is in fact contained in PP. Along these lines, it has been shown [2] that P[superscript NP[log]] is contained in PP. However, a lower bound of Minsky and Papert [8] implies that [sigma] p/2 is not contained in PP relative to an oracle [5]. Thus we ask how much of the
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: 25749311
Notes: "January 22, 1991."
Description: 11 pages ; 28 cm.
Series Title: Yale University.; Department of Computer Science.; Technical report
Responsibility: Richard Beigel.

Abstract:

Abstract: "Toda [13] has shown that the polynomial hierarchy is contained in P[superscript PP]. It is natural to ask whether the polynomial hierarchy is in fact contained in PP. Along these lines, it has been shown [2] that P[superscript NP[log]] is contained in PP. However, a lower bound of Minsky and Papert [8] implies that [sigma] p/2 is not contained in PP relative to an oracle [5]. Thus we ask how much of the polynomial hierarchy is contained in PP. We construct an oracle relative to which P[superscript NP[f(n)]] is contained in PP if and only if f(n) = O(log n), so the results of [2] are optimal in a relativized world. In particular, relative to this oracle, [delta] p/2 is not contained in PP.

Our oracle is also the first relative to which [formula] is properly contained of [formula], or in the terminology of Wagner's refined polynomial hierarchy [15], [theta] p/2 is properly contained in [delta] p/2. Our construction depends on a new lower bound for perceptrons, which is interesting in its own right. We construct a predicate that is computable by a small perceptron, but which requires exponentially large weights. This lower bound depends in turn on a fundamental property of polynomials: if p is bounded on the domain [1 ..., m] then the coefficients of p must be small as a function of m."

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


Primary Entity

<http://www.worldcat.org/oclc/25749311> # Polynomial interpolation, threshold circuits, and the polynomial hierarchy
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "25749311" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/2245419090#Place/new_haven_conn> ; # New Haven, Conn.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/ctu> ;
   schema:about <http://id.worldcat.org/fast/1070715> ; # Polynomials
   schema:bookFormat bgn:PrintBook ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/2245419090#Person/beigel_richard> ; # Richard Beigel
   schema:datePublished "1991" ;
   schema:description "Abstract: "Toda [13] has shown that the polynomial hierarchy is contained in P[superscript PP]. It is natural to ask whether the polynomial hierarchy is in fact contained in PP. Along these lines, it has been shown [2] that P[superscript NP[log]] is contained in PP. However, a lower bound of Minsky and Papert [8] implies that [sigma] p/2 is not contained in PP relative to an oracle [5]. Thus we ask how much of the polynomial hierarchy is contained in PP. We construct an oracle relative to which P[superscript NP[f(n)]] is contained in PP if and only if f(n) = O(log n), so the results of [2] are optimal in a relativized world. In particular, relative to this oracle, [delta] p/2 is not contained in PP."@en ;
   schema:description "Our oracle is also the first relative to which [formula] is properly contained of [formula], or in the terminology of Wagner's refined polynomial hierarchy [15], [theta] p/2 is properly contained in [delta] p/2. Our construction depends on a new lower bound for perceptrons, which is interesting in its own right. We construct a predicate that is computable by a small perceptron, but which requires exponentially large weights. This lower bound depends in turn on a fundamental property of polynomials: if p is bounded on the domain [1 ..., m] then the coefficients of p must be small as a function of m.""@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/2245419090> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/2245419090#Series/technical_report_yale_university_dept_of_computer_science> ; # Technical report. Yale University. Dept. of Computer Science ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/2245419090#Series/technical_report> ; # Technical report ;
   schema:name "Polynomial interpolation, threshold circuits, and the polynomial hierarchy"@en ;
   schema:productID "25749311" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/25749311#PublicationEvent/new_haven_conn_yale_university_dept_of_computer_science_1991> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/2245419090#Agent/yale_university_dept_of_computer_science> ; # Yale University, Dept. of Computer Science
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/25749311> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/2245419090#Agent/yale_university_dept_of_computer_science> # Yale University, Dept. of Computer Science
    a bgn:Agent ;
   schema:name "Yale University, Dept. of Computer Science" ;
    .

<http://experiment.worldcat.org/entity/work/data/2245419090#Organization/yale_university_department_of_computer_science> # Yale University. Department of Computer Science.
    a schema:Organization ;
   schema:name "Yale University. Department of Computer Science." ;
    .

<http://experiment.worldcat.org/entity/work/data/2245419090#Person/beigel_richard> # Richard Beigel
    a schema:Person ;
   schema:familyName "Beigel" ;
   schema:givenName "Richard" ;
   schema:name "Richard Beigel" ;
    .

<http://experiment.worldcat.org/entity/work/data/2245419090#Place/new_haven_conn> # New Haven, Conn.
    a schema:Place ;
   schema:name "New Haven, Conn." ;
    .

<http://experiment.worldcat.org/entity/work/data/2245419090#Series/technical_report> # Technical report ;
    a bgn:PublicationSeries ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/2245419090#Organization/yale_university_department_of_computer_science> ; # Yale University. Department of Computer Science.
   schema:hasPart <http://www.worldcat.org/oclc/25749311> ; # Polynomial interpolation, threshold circuits, and the polynomial hierarchy
   schema:name "Technical report ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/2245419090#Series/technical_report_yale_university_dept_of_computer_science> # Technical report. Yale University. Dept. of Computer Science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/25749311> ; # Polynomial interpolation, threshold circuits, and the polynomial hierarchy
   schema:name "Technical report. Yale University. Dept. of Computer Science ;" ;
    .

<http://id.worldcat.org/fast/1070715> # Polynomials
    a schema:Intangible ;
   schema:name "Polynomials"@en ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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