"Bounds on discrete dynamic programming recursions. II. Polynomial bounds ..."

Karel Sladký (1981)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition @ kybernetika.cz (open access)
- export record
  dblp key:
  - journals/kybernetika/Sladky81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/kybernetika/Sladky81
Karel Sladký:
Bounds on discrete dynamic programming recursions. II. Polynomial bounds on problems with block-triangular structure. Kybernetika 17(4): 310-328 (1981)

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.