Professional Documents
Culture Documents
Two Remarks On The Power PDF
Two Remarks On The Power PDF
A u g u s t 1982
ABSTRACT
1. INTRODUCTION
2. DEFINITIONS
In t h i s Section we p r o v e the f o l l o w i n g :
THEOREM 1: p N P [ t o g ] c ~qfP.
CHOOSE(IDo(M',x'),APPEND(DUPLk(I),Cl),APPEND(DUPLk(i)Co)),
2,
where IDo(M',x') denotes t h e i n i t i a l c o n f i g u r a t i o n of t h e machine M' on i n p u t x ' ,
and t h e k(i)'s are i n t e g e r s to be defined l a t e r . In w o r d s , N nondeterministically
chooses among t h r e e p o s s i b i l i t i e s : e i t h e r to simulate M' on x ' and stop; o r to as-
sume t h e answer is " y e s " and a m p l i f y the s u b s e q u e n t computation b y a f a c t o r of
k(i); o r f i n a l l y to assume the a n s w e r is " n o " , in which case t h e a n s w e r is ampli-
fied b y k ( i ) 2 (see t h e f i g u r e below f o r a p i c t o r i a l p r e s e n t a t i o n of t h e c o n s t r u c t i o n
using computation t r e e s ) .
Computation Tree of N
~
Computation Tree of M
query
T h e f u l l a l g o r i t h m is t h e f o l l o w i n g :
ALGORITHM A;
BEGIN
c o n s t r u c t N as d e s c r i b e d a b o v e ;
n ~ COUNT(N,x);
i÷1;
WHILE n > 1 DO
BEGIN
IF n MOD k ( i ) = 0 THEN n ~ n DIV k ( i ) 2
ELSE n ~ ( n MOD k ( i ) 2) DIV k ( i ) ;
i÷i+l
END;
IF n = 1 T H E N accept E L S E reject
END.
T h e k(i)~s a r e d e f i n e d b y t h e f o l l o w i n g e q u a t i o n s :
k([~glxlj) = 2p ( I x l )
k ( i ) = k ( i + 1) 4
c e p t i n g c o m p u t a t i o n s in t h e s u b t r e e of N c o r r e s p o n d i n g to C o . T h i s is because t h e
growth of t h e k ( i ) l s is such t h a t t h e t o t a l n u m b e r of leaves in t h e s u b t r e e o f N
c o r r e s p o n d i n g to C O ( o r f o r t h a t m a t t e r to C1) is less t h a n k ( i ) . S i m i l a r l y , if t h e
answer to the ith query is " y e s " , t h e n t h e ELSE b r a n c h is t a k e n , and n becomes
t h e n u m b e r o f a c c e p t i n g leaves in a s u b t r e e of N t h a t c o r r e s p o n d s t o C 1. T h e i n -
d u c t i o n is c o m p l e t e .
Therefore, after the last execution of the loop, the value of n is the number
of accepting computations of M after the last oracle step. This number is of course
1 or 0, depending on whether x is accepted by M or not. QED.
4. PARITY COUNTING
eP
THEOREM 2: OP = OP •
In w o r d s , t h e n u m b e r o f a c c e p t i n g leaves of C 1 is m u l t i p l i e d b y t h e n u m b e r of
a c c e p t i n g leaves of M' on x ' , w h e r e a s t h e n u m b e r of a c c e p t i n g leaves of C O is m u l -
t i p l i e d b y t h a t of M' on x ' p l u s o n e .
275
REFERENCES