R:::SN:::::1-tt::(NP) Distinguishes Robust Many-One and Turing Completeness

Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel. R:::SN:::::1-tt::(NP) Distinguishes Robust Many-One and Turing Completeness. In Gian Carlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista, editors, Algorithms and Complexity, Third Italian Conference, CIAC 97, Rome, Italy, March 12-14, 1997, Proceedings. Volume 1203 of Lecture Notes in Computer Science, pages 49-60, Springer, 1997.

Abstract

Abstract is missing.