Question: Prove that the following two problems have the same complexity by giving a linear-time reductions between the two. 1. 3-SUM: given n integers x1, ...,

Prove that the following two problems have the same complexity by giving a linear-time reductions between the two. 1. 3-SUM: given n integers x1, ..., x, are there three distinct integers i, j, and k such that x+3-0 3-SUM-PLUS: given n integers x, and an integer b are there three distinct integers i.j, and k such that x+-b Give a linear-time reduction from 3-SUM-PLUS to 3-SUM. To demonstrate your reduction, give the 3-SUM instance that you would construct to solve the following 3-SUM-PLUS instance: b, xi, , & a. Prove that the following two problems have the same complexity by giving a linear-time reductions between the two. 1. 3-SUM: given n integers x1, ..., x, are there three distinct integers i, j, and k such that x+3-0 3-SUM-PLUS: given n integers x, and an integer b are there three distinct integers i.j, and k such that x+-b Give a linear-time reduction from 3-SUM-PLUS to 3-SUM. To demonstrate your reduction, give the 3-SUM instance that you would construct to solve the following 3-SUM-PLUS instance: b, xi, , & a
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
