How hard are n2-hard problems?

Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith. How hard are n2-hard problems?. SIGACT News, 25(2):83-85, 1994. [doi]

@article{BlochBG94,
  title = {How hard are n2-hard problems?},
  author = {Stephen A. Bloch and Jonathan F. Buss and Judy Goldsmith},
  year = {1994},
  doi = {10.1145/181462.181465},
  url = {http://doi.acm.org/10.1145/181462.181465},
  researchr = {https://researchr.org/publication/BlochBG94},
  cites = {0},
  citedby = {0},
  journal = {SIGACT News},
  volume = {25},
  number = {2},
  pages = {83-85},
}