"How hard are n2-hard problems?"

Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith (1994)

> Home

Details and statistics

DOI: 10.1145/181462.181465

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/sigact/BlochBG94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigact/BlochBG94
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith:
How hard are n2-hard problems? SIGACT News 25(2): 83-85 (1994)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.