Question: A permutation on the set {1, . . . , k} is a one-to-one, onto function on this set. When p is a permutation, p

A permutation on the set {1, . . . , k} is a one-to-one, onto function on this set. When p is a permutation, pt means the composition of p with itself t times. Let

PERM-POWER = {{p,q, t)| p = q' where p and q are permutations on {1, ..., k} and t is a binary integer}.


Show that PERM-POWER ∈ P. Note that the most obvious algorithm doesn’t run within polynomial time. First try it where t is a power of 2.

PERM-POWER = {{p,q, t)| p = q' where p and q are permutations on {1, ..., k} and t is a binary integer}.

Step by Step Solution

3.50 Rating (160 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To show that PERMPOWER P we need to give a polynomialtime algorithm that decides whether a given triple p q t is in PERMPOWER One way to approach this ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction theory computation Questions!