On properties of random reductions

Randomness is widely accepted as a powerful computational resource because the most elegant and efficient solutions to several computational problems are randomized. A recurrent theme in the theory of randomized computation is the notion of a random reduction. Random reductions are similar to many-o...

Full description

Bibliographic Details
Corporate Author: Cornell University Department of Computer Science
Other Authors: Rohatgi, P
Format: Book
Language:English
Published: 1993
Subjects:

Internet

This item is not available through BorrowDirect. Please contact your institution’s interlibrary loan office for further assistance.

Stanford University

Holdings details from Stanford University
Call Number: 126675
ISIL:US-CST