Robust Reductions
| dc.creator | Cai, Jin-Yi | |
| dc.creator | Hemaspaandra, Lane A. | |
| dc.creator | Wechsung, Gerd | |
| dc.date | 1999-06-29 | |
| dc.date.accessioned | 2026-07-07T03:24:12Z | |
| dc.date.available | 2026-07-07T03:24:12Z | |
| dc.description | We continue the study of robust reductions initiated by Gavalda and Balcazar. In particular, a 1991 paper of Gavalda and Balcazar 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. | |
| dc.description | 26 pages; 1 figure; will appear in Theory of Computing Systems; earlier versions appear as UR-CS-TR-666 and in COCOON 98 | |
| dc.identifier | https://arxiv.org/abs/cs/9906033 | |
| dc.identifier | http://arxiv.org/abs/cs/9906033 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33231 | |
| dc.subject | Computational Complexity | |
| dc.subject | F.1.3; F.1.2 | |
| dc.title | Robust Reductions | |
| dc.type | text |