Presentation 1995/7/21
On the Oracle Entropy and the Average Case Oracle Measure of Knowledge Complexity
Toshiya Itoh,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we investigate statistical and perfect Knowledge Complexity(KC) with respect to oracle entropy and average case oracle measures. As main results, we show the following : (1)for any k(n)≥1/poly(n), if a language L has perfect KC k(n)+n^<-w(1)> with respect to oracle entropy measure, then L has perfect KC k(n) with respect to average case oracle measure (Theorem 3.1) ; (2)for any k(n)≥1/poly(n), if a language L has perfect KC k(n)+n^<-w(1)> with respect to average case oracle measure, then L has perfect KC k(n) with respect to average case oracle measure (Theorem 3.2) ; (3)if a language L has statistical KC k(n)∈o(1) with respect to oracle entropy measure, then for any ∈>0, L has statistical KC k(n)+1+∈ with respect to average case oracle measure (Theorem 4.1) ; and (4) if a language L has perfect KC k(n)∈o(1) with respect to oracle entropy measure, then for any c>0, L has perfect KC k(n)+2+∈ with respect to average case oracle measure (Theorem 4.2).
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Statistical KC / Perfect KC / Oracle Entropy Measure / Average Case Oracle Measure
Paper #
Date of Issue

Conference Information
Committee ISEC
Conference Date 1995/7/21(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On the Oracle Entropy and the Average Case Oracle Measure of Knowledge Complexity
Sub Title (in English)
Keyword(1) Statistical KC
Keyword(2) Perfect KC
Keyword(3) Oracle Entropy Measure
Keyword(4) Average Case Oracle Measure
1st Author's Name Toshiya Itoh
1st Author's Affiliation Department of Information Processing, Tokyo Institute of Technology()
Date 1995/7/21
Paper #
Volume (vol) vol.95
Number (no) 172
Page pp.pp.-
#Pages 17
Date of Issue