DocumentCode
3358418
Title
The power of witness reduction
Author
Gupta, Sanjay
Author_Institution
Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
fYear
1991
fDate
30 Jun-3 Jul 1991
Firstpage
43
Lastpage
59
Abstract
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
Keywords
computational complexity; function classes; randomly hard functions; witness reduction; Complexity theory; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Structure in Complexity Theory Conference, 1991., Proceedings of the Sixth Annual
Conference_Location
Chicago, IL
Print_ISBN
0-8186-2255-5
Type
conf
DOI
10.1109/SCT.1991.160242
Filename
160242
Link To Document