"The P-matrix problem is co-NP-complete."

Gregory Emmett Coxson (1994)

> Home

Details and statistics

DOI: 10.1007/BF01582570

access: closed

type: Journal Article

metadata version: 2019-12-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/Coxson94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/Coxson94
Gregory Emmett Coxson:
The P-matrix problem is co-NP-complete. Math. Program. 64: 173-178 (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.