Strong and robustly strong polynomial time reducibilities to sparse sets
Document typeExternal research report
Rights accessOpen Access
Reducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relativized strength are presented and separated. The corresponding reduction classes of the sparse sets give two nonuniform analogs of the class N P ¿ coN P. An oracle-restricted positive relativization of the probabilistic class Z P P is developed.
CitationGavaldà, R.; Balcazar, J. L. "Strong and robustly strong polynomial time reducibilities to sparse sets". 1988.
Is part ofLSI-88-15-R