How hard are n2-hard problems?

  • Authors:

  • Stephen A. Bloch;Jonathan F. Buss;Judy Goldsmith

  • Affiliations:

  • -;-;-

  • Venue:
  • ACM SIGACT News
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many of the "n2-hard" problems described by Gajentaan and Overmars can be solved using limited nondeterminism or other sharply-bounded quantifiers. Thus we suggest that problems are not among the hardest problems solvable in quadratic time