The power of witness reduction

Recent results by M. Ogiwara and L.A. Hemachandra (1990) established a connection between functions being hard for a class of functions and functions interacting with the class to effect witness reduction. The author believes that the ability to achieve some form of witness reduction is what makes a...

Full description

Saved in:
Bibliographic Details
Published in[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference pp. 43 - 59
Main Author Gupta, S.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1991
Subjects
Complexity theory
Polynomials
Online AccessGet full text

Cover

More Information
Summary:Recent results by M. Ogiwara and L.A. Hemachandra (1990) established a connection between functions being hard for a class of functions and functions interacting with the class to effect witness reduction. The author believes that the ability to achieve some form of witness reduction is what makes a function hard for a class of functions. To support this thesis he defines new function classes and obtains results analogous to those of Ogiwara and Hemachandra. He also introduces the notion of randomly hard functions and obtains similar results.< >
ISBN:9780818622557
0818622555
DOI:10.1109/SCT.1991.160242