Using Cloning to Solve NP Complete Problems

John A. Drakopoulos, Theodore N. Tomaras

Assuming a cloning oracle, satisfiability, which is an NP complete problem, is shown to belong to $BP{P}^C$ and $BQ{P}^C$ (depending on the ability of the oracle C to clone either a bi…