Article thumbnail

Generalized juntas and NP-hard sets

By Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe and Holger Spakowski

Abstract

AbstractWe 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

Publisher: Elsevier B.V.
Year: 2009
DOI identifier: 10.1016/j.tcs.2009.06.026
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://s3-eu-west-1.amazonaws... (external link)
  • https://s3.amazonaws.com/prod-... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles