"On the Complexity of the Bernstein Combinatorial Problem."

Dominique Michelucci, Sebti Foufou, Arnaud Kubicki (2012)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2020-04-16

- view
  - electronic edition @ louisiana.edu (open access)
- export record
  dblp key:
  - journals/rc/MichelucciFK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rc/MichelucciFK12
Dominique Michelucci, Sebti Foufou, Arnaud Kubicki:
On the Complexity of the Bernstein Combinatorial Problem. Reliab. Comput. 17: 22-33 (2012)

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.