"On the Complexity of Graph-Based Bounds for the Probability Bounding Problem."

Andrea Scozzari, Fabio Tardella (2009)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2009-06-17

- view
  - electronic edition @ polytechnique.fr
- export record
  dblp key:
  - conf/colognetwente/ScozzariT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colognetwente/ScozzariT09
Andrea Scozzari, Fabio Tardella:
On the Complexity of Graph-Based Bounds for the Probability Bounding Problem. CTW 2009: 235-238

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.