Matches in SemOpenAlex for { <https://semopenalex.org/work/W1987693787> ?p ?o ?g. }
Showing items 1 to 60 of
60
with 100 items per page.
- W1987693787 endingPage "11" @default.
- W1987693787 startingPage "1" @default.
- W1987693787 abstract "Let f : {0, 1} n → {0, 1}. Let μ be a product probability measure on {0, 1} n . For ϵ ≥ 0, we define Dϵ ( f ), the ϵ-approximate decision tree complexity of f , to be the minimum depth of a decision tree T with μ ( T ( x ) ≠ f ( x )) ≤ ϵ . For j = 0 or 1 and for δ ≥ 0, we define Cj,δ ( f ), the δ-approximate j -certificate complexity of f , to be the minimum certificate complexity of a set A ⊆ Ω with μ ( AΔf −1 ( j )) ≤ ϵ . Note that if μ ( x ) > 0 for all x then D 0 ( f ) = D ( f ) and Cj ,0 ( f ) = Cj ( f ) are the ordinary decision tree and j -certificate complexities of f , respectively. We extend the well-known result, D ( f ) ≤ C 1 ( f ) C 0 ( f ) [Blum and Impagliazzo 1987; Hartmanis and Hemachandra 1991; Tardos 1989], proving that for all ϵ > 0 there exists a δ > 0 and a constant K = K ( ϵ , δ ) > 0 such that for all n , μ , f , Dϵ ( f ) ≤ K C 1, δ ( f ) C 0, δ ( f ). We also give a partial answer to a related question on query complexity raised by Tardos [1989]. We prove generalizations of these results to general product probability spaces." @default.
- W1987693787 created "2016-06-24" @default.
- W1987693787 creator A5076835963 @default.
- W1987693787 date "2011-08-01" @default.
- W1987693787 modified "2023-09-24" @default.
- W1987693787 title "Approximate Query Complexity" @default.
- W1987693787 cites W1965694896 @default.
- W1987693787 cites W1972416792 @default.
- W1987693787 cites W1977930625 @default.
- W1987693787 cites W2039800039 @default.
- W1987693787 cites W2060972166 @default.
- W1987693787 cites W2086239097 @default.
- W1987693787 cites W2094321606 @default.
- W1987693787 cites W2118792789 @default.
- W1987693787 cites W2145617053 @default.
- W1987693787 cites W605043455 @default.
- W1987693787 doi "https://doi.org/10.1145/2003685.2003688" @default.
- W1987693787 hasPublicationYear "2011" @default.
- W1987693787 type Work @default.
- W1987693787 sameAs 1987693787 @default.
- W1987693787 citedByCount "0" @default.
- W1987693787 crossrefType "journal-article" @default.
- W1987693787 hasAuthorship W1987693787A5076835963 @default.
- W1987693787 hasConcept C113174947 @default.
- W1987693787 hasConcept C11413529 @default.
- W1987693787 hasConcept C114614502 @default.
- W1987693787 hasConcept C118615104 @default.
- W1987693787 hasConcept C2524010 @default.
- W1987693787 hasConcept C33923547 @default.
- W1987693787 hasConcept C90673727 @default.
- W1987693787 hasConcept C96865113 @default.
- W1987693787 hasConceptScore W1987693787C113174947 @default.
- W1987693787 hasConceptScore W1987693787C11413529 @default.
- W1987693787 hasConceptScore W1987693787C114614502 @default.
- W1987693787 hasConceptScore W1987693787C118615104 @default.
- W1987693787 hasConceptScore W1987693787C2524010 @default.
- W1987693787 hasConceptScore W1987693787C33923547 @default.
- W1987693787 hasConceptScore W1987693787C90673727 @default.
- W1987693787 hasConceptScore W1987693787C96865113 @default.
- W1987693787 hasIssue "1" @default.
- W1987693787 hasLocation W19876937871 @default.
- W1987693787 hasOpenAccess W1987693787 @default.
- W1987693787 hasPrimaryLocation W19876937871 @default.
- W1987693787 hasRelatedWork W1978042415 @default.
- W1987693787 hasRelatedWork W1994589449 @default.
- W1987693787 hasRelatedWork W2017331178 @default.
- W1987693787 hasRelatedWork W2068483647 @default.
- W1987693787 hasRelatedWork W2260035625 @default.
- W1987693787 hasRelatedWork W2327995617 @default.
- W1987693787 hasRelatedWork W2963684113 @default.
- W1987693787 hasRelatedWork W2976797620 @default.
- W1987693787 hasRelatedWork W2999997131 @default.
- W1987693787 hasRelatedWork W3086542228 @default.
- W1987693787 hasVolume "3" @default.
- W1987693787 isParatext "false" @default.
- W1987693787 isRetracted "false" @default.
- W1987693787 magId "1987693787" @default.
- W1987693787 workType "article" @default.