"On the Hardness of Computing the Permanent of Random Matrices."

Uriel Feige, Carsten Lund (1997)

> Home

Details and statistics

DOI: 10.1007/BF01262928

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/FeigeL97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/FeigeL97
Uriel Feige, Carsten Lund:
On the Hardness of Computing the Permanent of Random Matrices. Comput. Complex. 6(2): 101-132 (1997)

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.