On the Unique Satisfiability Problem

Papadimitriou and Yannakakis were interested whether Unique Sat is hard for {L – L’ : L, L’ are NP} when NP differs from co-NP (otherwise the answer is obvious). We show that this is true under one oracle and false under another.