A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions
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

Wolfgang J. Paul
A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions
STOC, 1975.

STOC 1975
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1975-Paul,
	author        = "Wolfgang J. Paul",
	booktitle     = "{Proceedings of the Seventh Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/800116.803750",
	pages         = "27--36",
	publisher     = "{ACM}",
	title         = "{A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions}",
	year          = 1975,
}

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.