Explicit lower bound of 4.5n — o(n) for boolena circuits
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

Oded Lachish, Ran Raz
Explicit lower bound of 4.5n — o(n) for boolena circuits
STOC, 2001.

STOC 2001
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2001-LachishR,
	author        = "Oded Lachish and Ran Raz",
	booktitle     = "{Proceedings of the 33rd Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/380752.380832",
	isbn          = "1-58113-349-9",
	pages         = "399--408",
	publisher     = "{ACM}",
	title         = "{Explicit lower bound of 4.5n — o(n) for boolena circuits}",
	year          = 2001,
}

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.