2.6.A1-AkfA1-fAkMF062310

2.6.A1-AkfA1-fAkMF062310 - 1 2.6. EBRT in...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 2.6. EBRT in A 1 ,...,A k ,fA 1 ,...,fA k , on (MF,INF). In this section, we use the tree methodology presented in section 2.1 to analyze EBRT in A 1 ,...,A k ,fA 1 ,...,fA k , on (MF,INF). This turns out to be very easy, and we obtain the same classification if we replace MF by any subset of MF satisfying some weak conditions. In particular, we show that EBRT in A 1 ,...,A k ,fA 1 ,...,fA k , on (MF,INF) is RCA 0 secure. Note that in sections 2.4 and 2.5, we have stayed within EBRT in A,B,fA,fB, . EBRT in A,B,fA,fB on (SD,INF),(ELG SD,INF), (ELG,INF),(EVSD,INF), is a major additional undertaking, and is beyond the scope of this book. The same can be said for various fragments of EBRT in A,B,C,fA,fB,fC, on (SD,INF),(ELG SD,INF),(ELG,INF),(EVSD,INF). However, EBRT on (MF,INF) is considerably easier to analyze, due to the presence of constant functions and projection functions. As usual, we start with the list of all
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

2.6.A1-AkfA1-fAkMF062310 - 1 2.6. EBRT in...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online