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:   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 p. ; 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


<http://www.worldcat.org/oclc/31690417>
library:oclcnum"31690417"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/31690417>
rdf:typeschema:Book
schema:about
schema:about
<http://id.worldcat.org/fast/871991>
rdf:typeschema:Intangible
schema:name"Computational complexity"@en
schema:name"Computational complexity."@en
schema:contributor
schema:contributor
schema:creator
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:name"Frequency computation and bounded queries"@en
schema:numberOfPages"16"
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.