Robust Reductions

Authors:
Jin-yi Cai;Lane A. Hemaspaandra;Gerd Wechsung
Affiliations:
-;-;-
Venue:
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Year:
1998

Citing 9
Cited 0

Relativizing complexity classes with sparse oracles

Journal of the ACM (JACM)
On hiding information form an oracle

Journal of Computer and System Sciences
Robust machines accept easy sets

Theoretical Computer Science
Nonuniform proof systems: a new framework to describe nonuniform and probabilistic complexity classes

Theoretical Computer Science
Strong and robustly strong polynomial-time reducibilities to sparse sets

Theoretical Computer Science
Almost-everywhere complexity hierarchies for nondeterministic time

Theoretical Computer Science
New Collapse Consequences of NP Having Small Circuits

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Some connections between nonuniform and uniform complexity classes

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Robust Reductions

Robust Reductions

Quantified Score

Hi-index	0.00

Visualization

Abstract

We continue the study of robust reductions initiated by Gavaldà and Balcázar. In particular, a 1991 paper of Gavaldà and Balcázar [6] claimed an optimal separation between the power of robust and nondeterministic strong reductions. Unfortunately, their proof is invalid. We re-establish their theorem. Generalizing robust reductions, we note that robustly strong reductions are built from two restrictions, robust underproductivity and robust overproductivity, both of which have been separately studied before in other contexts. By systematically analyzing the power of these reductions, we explore the extent to which each restriction weakens the power of reductions.We show that one of these reductions yields a new, strong form of the Karp-Lipton Theorem.