Derandomizing polynomial identity tests means proving circuit lower bounds
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

Valentine Kabanets, Russell Impagliazzo
Derandomizing polynomial identity tests means proving circuit lower bounds
STOC, 2003.

STOC 2003
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2003-KabanetsI,
	author        = "Valentine Kabanets and Russell Impagliazzo",
	booktitle     = "{Proceedings of the 35th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/780542.780595",
	isbn          = "1-58113-674-9",
	pages         = "355--364",
	publisher     = "{ACM}",
	title         = "{Derandomizing polynomial identity tests means proving circuit lower bounds}",
	year          = 2003,
}

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.