Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Comparing two Probabilistic Models of the Computational Complexity of the ..."

Michèle Dion, Marc Gengler, Stéphane Ubéda (1994)

> Home

Details and statistics

DOI: 10.1007/3-540-58430-7_32

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/conpar/DionGU94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/conpar/DionGU94
Michèle Dion, Marc Gengler, Stéphane Ubéda:
Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm. CONPAR 1994: 359-370

a service of

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.