"On the Computational Complexity of the Minimum Committee Problem."

Mikhail Yu. Khachay (2007)

> Home

Details and statistics

DOI: 10.1007/S10852-006-9056-Z

access: closed

type: Journal Article

metadata version: 2017-06-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jmma/Khachay07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jmma/Khachay07
Mikhail Yu. Khachay:
On the Computational Complexity of the Minimum Committee Problem. J. Math. Model. Algorithms 6(4): 547-561 (2007)

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.