WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/34491550

Frequency computation and bounded queries

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."

Open All Close All

type

about

contributor

creator

description

http://schema.org/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

name

http://schema.org/name

  • "Frequency computation and bounded queries"@en

workExample