Generalized juntas and NP-hard sets

Theoretical Computer Science

Volumn 410, Issue 38-40, 2009, Pages 3995-4000

  Erdélyi, Gábor ^a   Hemaspaandra, Lane A ^b   Rothe, Jörg ^a   Spakowski, Holger ^c  

^a HEINRICH HEINE UNIVERSITY   (Germany)

^b University of Rochester   (United States)

^c UNIVERSITY OF CAPE TOWN   (South Africa)

Author keywords

Junta distributions; NP completeness; Padding

Indexed keywords

HIGH PROBABILITY; JUNTA DISTRIBUTIONS; NP-COMPLETENESS; NP-HARD; PADDING; POLYNOMIAL-TIME ALGORITHMS;

COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS;

PROBABILITY DISTRIBUTIONS;

EID: 68249115816     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.06.026     Document Type: Article

References (17)

1. Berman L., and Hartmanis J. On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing 6 2 (1977) 305-322
2. Bogdanov A., and Trevisan L. Average-Case Complexity (2006), Now Publishers
3. Bartholdi III J., Tovey C., and Trick M. How hard is it to control an election?. Mathematical and Computer Modelling 16 8-9 (1992) 27-40
4. G. Erdélyi, L. Hemaspaandra, J. Rothe, H. Spakowski, Frequency of correctness versus average-case polynomial time and generalized juntas, Technical Report TR-934, Department of Computer Science, University of Rochester, Rochester, NY, June 2008
5. O. Goldreich, Notes on Levin's theory of average-case complexity, Technical Report TR97-058, Electronic Colloquium on Computational Complexity, November 1997
6. Homan C., and Hemaspaandra L. Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. Journal of Heuristics 15 4 (2009) 403-423 Conference version available as~[8] and earlier version available as~[7]
7. C. Homan, L. Hemaspaandra, Guarantees for the success frequency of an algorithm for finding Dodgson-election winners, Technical Report TR-881, Department of Computer Science, University of Rochester, Rochester, NY, September 2005. Revised, June 2007
8. Homan C., and Hemaspaandra L. Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science vol. #4162 (2006), Springer-Verlag 528-539
9. Impagliazzo R. A personal view of average-case complexity. Proceedings of the 10th Structure in Complexity Theory Conference (1995), IEEE Computer Society Press 134-147
10. Levin L. Average case complete problems. SIAM Journal on Computing 15 1 (1986) 285-286
11. Li M., and Vitányi P. Average case complexity under the universal distribution equals worst-case complexity. Information Processing Letters 42 3 (1992) 145-149
12. Miltersen P. The complexity of malign measures. SIAM Journal on Computing 22 1 (1993) 147-156
13. Procaccia A., and Rosenschein J. Junta distributions and the average-case complexity of manipulating elections. Journal of Artificial Intelligence Research 28 (2007) 157-181
14. A. Procaccia, Personal communication, April 8, 2007
15. L. Trevisan, Lecture notes on computational complexity, Lecture 12, 2002. www.cs.berkeley.edu/~luca/notes/complexitynotes02.pdf
16. Wang J. Average-case computational complexity theory. In: Hemaspaandra L., and Selman A. (Eds). Complexity Theory Retrospective II (1997), Springer-Verlag 295-328
17. Wang J. Average-case intractable NP problems. In: Du D., and Ko K. (Eds). Advances in Languages, Algorithms, and Complexity (1997), Kluwer Academic Publishers 313-378