Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
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

Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
ICALP, 1999.

ICALP 1999
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-1999-AndreevBCR,
	author        = "Alexander E. Andreev and Juri L. Baskakov and Andrea E. F. Clementi and José D. P. Rolim",
	booktitle     = "{Proceedings of the 26th International Colloquium on Automata, Languages and Programming}",
	doi           = "10.1007/3-540-48523-6_15",
	isbn          = "3-540-66224-3",
	pages         = "179--189",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs}",
	volume        = 1644,
	year          = 1999,
}

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.