28 citations · 49 across the 5 of their papers we have counts for
1 paper · 2 filters
John A. Drakopoulos, Theodore N. Tomaras
Assuming a cloning oracle, satisfiability, which is an NP complete problem, is shown to belong to BPPC and BQPC (depending on the ability of the oracle C to clone either a bi…