On the Hardness of Computing the Permanent of Random Matrices
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Uriel Feige, Carsten Lund
On the Hardness of Computing the Permanent of Random Matrices
STOC, 1992.

STOC 1992
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1992-FeigeL,
	author        = "Uriel Feige and Carsten Lund",
	booktitle     = "{Proceedings of the 24th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/129712.129775",
	isbn          = "0-89791-511-9",
	pages         = "643--654",
	publisher     = "{ACM}",
	title         = "{On the Hardness of Computing the Permanent of Random Matrices}",
	year          = 1992,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.