Loading in 5 sec....

Chapter 1 The Self-Reducibility Technique Matt Boutell and Bill Scherer CSC 486 April 4, 2001PowerPoint Presentation

Chapter 1 The Self-Reducibility Technique Matt Boutell and Bill Scherer CSC 486 April 4, 2001

- By
**omer** - Follow User

- 299 Views
- Uploaded on

Download Presentation
## PowerPoint Slideshow about 'here as powerpoint' - omer

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

Chapter 1The Self-Reducibility TechniqueMatt Boutell and Bill SchererCSC 486April 4, 2001

Historical Perspective

[Berman 1978]: P=NP

a tally set that is m-hard for NP

[Mahaney 1982]: P=NP

a sparse set that is m-complete for NP

[Ogiwara, Watanabe 1991]: today’s lecture

p

p

Proof Overview

p

Theorem: If an NP btt-hard sparse set S,

then P = NP.

Technique: let L be an arbitrary language in NP. Then, using S and the reduction, we give a deterministic polynomial algorithm to decide L.

Accept

An Alternate Characterization of the Class NPA language LNP [AP, polynomial p | x*, xL

IFF (w)[wp(|x|) x,wA].

x = input

w = witness = certificate = accepting path:

A = checking algorithm

Accept

Left SetsThe left set, denoted Left[A,p], is {x,y | x*

yp(|x|) (wp(|x|))[w lex y x,wA]}.

Note that having the left set non-empty the

existence of an accepting path.

Maximum Witnesses

The Maximum Witness for some input x, denoted

wmax(x), is max{y | yp(|x|) x,yA]}.

Deciding xL Determining if wmax(x) is defined.

(x*)(yp(|x|))[x,yLeft[A,p] ylex wmax(x)].

(1.4)

Left[A,p] NP

Left[A,p] NP (by guessing wmax(x)), so since S

is NP-hard, Left[A,p] btt S via some function f.

p

What does btt mean?

p

p

Bounded truth table reductions, btt, are a type of

reduction that uses a very weak form of oracle.

Ak-ttB via some function f means that A = L(MB),

where M is a deterministic polynomial machine that on

input x precomputes up to k queries, asks them all in

parallel, and uses a k-ary Boolean function to compute

the output.

v1v2 v3 … vk

0 0 0 … 0 Yes

M: 0 0 0 … 1 No

1 1 1 … 1 No

p

Back to the Proof…

Let u be a pair x,y. Then with our reduction,

uLeft[A,p] S satisfies f(u).

Now, with query strings v1, v2, v3, … vk, let

(S(v1), S(v2), S(v3), … S(vk)) {Yes, No};

this line is a row in the truth table in our

reduction to S.

So f(u) is of the form , v1, v2, v3, … vk.

Intervals

The trick we will use is to generate a polynomially

bounded list of candidates for wmax(x). Once this list

is generated, we can use brute force computation to

see if any of these candidates are in fact witnesses.

We do this by keeping track of a set of pair-wise

disjoint intervals in the range 0p(|X|)..1p(|X|), starting

initially with the entire range.

wmax(x)

Last Definition: CoveringLet 1, 2 be two collections of pair-wise disjoint

intervals over p(|x|). Then 1 covers 2 with respect

to x if:

1) (I2) (J1)[IJ]

2) wmax(x) UI1 wmax(x) UI2

0

1

2

wmax(x)

Facts With CoveringLet 1, 2, 3, 4 be sets of pair-wise disjoint

intervals over p(|x|). Then (all with respect to x):

1) If the interval invariant holds for 1 and

2 is a cover of 1, it also holds for 2.

2) If 2 covers 1 and 3 covers 2, then 3

covers 1.

3) If 2 covers 1 and 4 covers 3, then 2U4

covers 1U3.

0

1

2

Download Presentation

Connecting to Server..