"On the hardness of approximating the permanent of structured matrices."

Bruno Codenotti, Igor E. Shparlinski, Arne Winterhof (2002)

> Home

Details and statistics

DOI: 10.1007/S00037-002-0174-3

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/CodenottiSW02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/CodenottiSW02
Bruno Codenotti, Igor E. Shparlinski, Arne Winterhof:
On the hardness of approximating the permanent of structured matrices. Comput. Complex. 11(3-4): 158-170 (2002)

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.