skip to content
Frequency computation and bounded queries Preview this item
ClosePreview this item
Checking...

Frequency computation and bounded queries

Author: Richard Beigel; William I Gasarch; E B Kinber
Publisher: College Park, Md. : University of Maryland, [1993]
Series: Computer science technical report series (University of Maryland at College Park), CS-TR-3187.
Edition/Format:   Print book : English
Database:WorldCat
Summary:
Abstract: "For a set A and a number m let F[superscript A, subscript n](x₁ ..., x[subscript n]) = [subscript XA](x₁) ... [subscript XA](x[subscript n]). We study how hard it is to approximate this function in terms of the number of queries required. We obtain matching upper and lower bounds for the case A = K (the halting set), A semirecursive, and (assuming P [not equal] NP) A = SAT. Some of our bounds depend on  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: Richard Beigel; William I Gasarch; E B Kinber
OCLC Number: 31690417
Notes: Cover title.
"UMIACS-TR-93-128."
"December 1993."
Description: 16 pages ; 28 cm.
Series Title: Computer science technical report series (University of Maryland at College Park), CS-TR-3187.
Responsibility: Richard Beigel, William Gasarch, Efim Kinber.

Abstract:

Abstract: "For a set A and a number m let F[superscript A, subscript n](x₁ ..., x[subscript n]) = [subscript XA](x₁) ... [subscript XA](x[subscript n]). We study how hard it is to approximate this function in terms of the number of queries required. We obtain matching upper and lower bounds for the case A = K (the halting set), A semirecursive, and (assuming P [not equal] NP) A = SAT. Some of our bounds depend on functions from coding theory."

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/31690417> # Frequency computation and bounded queries
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "31690417" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mdu> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/34491550#Place/college_park_md> ; # College Park, Md.
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/32836356> ; # William I. Gasarch
    schema:contributor <http://viaf.org/viaf/43860074> ; # E. B. Kinber
    schema:creator <http://viaf.org/viaf/91642547> ; # Richard Beigel
    schema:datePublished "1993" ;
    schema:description "Abstract: "For a set A and a number m let F[superscript A, subscript n](x₁ ..., x[subscript n]) = [subscript XA](x₁) ... [subscript XA](x[subscript n]). We study how hard it is to approximate this function in terms of the number of queries required. We obtain matching upper and lower bounds for the case A = K (the halting set), A semirecursive, and (assuming P [not equal] NP) A = SAT. Some of our bounds depend on functions from coding theory.""@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/34491550> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/34491550#Series/computer_science_technical_report_series_university_of_maryland> ; # Computer science technical report series / University of Maryland ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/34491550#Series/computer_science_technical_report_series_university_of_maryland_at_college_park> ; # Computer science technical report series (University of Maryland at College Park) ;
    schema:name "Frequency computation and bounded queries"@en ;
    schema:productID "31690417" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/31690417#PublicationEvent/college_park_md_university_of_maryland_1993> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/34491550#Agent/university_of_maryland> ; # University of Maryland
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/31690417> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/34491550#Agent/university_of_maryland> # University of Maryland
    a bgn:Agent ;
    schema:name "University of Maryland" ;
    .

<http://experiment.worldcat.org/entity/work/data/34491550#Place/college_park_md> # College Park, Md.
    a schema:Place ;
    schema:name "College Park, Md." ;
    .

<http://experiment.worldcat.org/entity/work/data/34491550#Series/computer_science_technical_report_series_university_of_maryland> # Computer science technical report series / University of Maryland ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/31690417> ; # Frequency computation and bounded queries
    schema:name "Computer science technical report series / University of Maryland ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/34491550#Series/computer_science_technical_report_series_university_of_maryland_at_college_park> # Computer science technical report series (University of Maryland at College Park) ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/31690417> ; # Frequency computation and bounded queries
    schema:name "Computer science technical report series (University of Maryland at College Park) ;" ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity"@en ;
    .

<http://viaf.org/viaf/32836356> # William I. Gasarch
    a schema:Person ;
    schema:familyName "Gasarch" ;
    schema:givenName "William I." ;
    schema:name "William I. Gasarch" ;
    .

<http://viaf.org/viaf/43860074> # E. B. Kinber
    a schema:Person ;
    schema:familyName "Kinber" ;
    schema:givenName "E. B." ;
    schema:name "E. B. Kinber" ;
    .

<http://viaf.org/viaf/91642547> # Richard Beigel
    a schema:Person ;
    schema:familyName "Beigel" ;
    schema:givenName "Richard" ;
    schema:name "Richard Beigel" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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