Note
Generalized juntas and NP-hard sets

https://doi.org/10.1016/j.tcs.2009.06.026Get rights and content
Under an Elsevier user license
open archive

Abstract

We show that many NP-hard sets have heuristic polynomial-time algorithms with high probability weight of correctness with respect to generalizations of Procaccia and Rosenschein’s junta distributions.

Keywords

NP-completeness
Padding
Junta distributions

Cited by (0)

Supported in part by NSF grant CCF-0426761, DFG grants RO 1202/{9-1, 9-3, 11-1, 12-1}, the European Science Foundation’s EUROCORES program LogICCC, the Alexander von Humboldt Foundation’s TransCoop program, a Friedrich Wilhelm Bessel Research Award, and the “CompView” Global COE, which supported Lane A. Hemaspaandra’s visit to the Tokyo Institute of Technology. Some of the results of this paper were presented at the Sixteenth International Symposium on Fundamentals of Computation Theory, August 2007 [G. Erdélyi, L. Hemaspaandra, J. Rothe, H. Spakowski, On approximating optimal weighted lobbying, and frequency of correctness versus average-case polynomial time, in: Proceedings of the 16th International Symposium on Fundamentals of Computation Theory, in: Lecture Notes in Computer Science vol. 4639, Springer-Verlag, 2007, pp. 300–311].

1

Work done in part while visiting Heinrich-Heine-Universität Düsseldorf and the Tokyo Institute of Technology.

2

Work done in part while visiting the University of Rochester.

3

Work done in part while at Heinrich-Heine-Universität Düsseldorf.