ExLibris header image
SFX Logo
Title: The Number of Values of a Boolean Function
Source:

Journal of the London Mathematical Society-Second Series [0024-6107] Daykin, D E yr:1976


Collapse list of basic services Basic
Sorry, no full text available...
Please use the document delivery service (see below)  
Holding information
Holdings in library search engine ALBERT GO
Document delivery
Request document via Library/Bibliothek GO
Users interested in this article also expressed an interest in the following:
1. Deza, M. "Intersection properties of systems of finite sets." Proceedings of the London Mathematical Society 36.2 (1978): 369-384. Link to SFX for this item
2. Frankl, P. "A probabilistic proof for the LYM-inequality." Discrete mathematics 43.2-3 (1983): 325-. Link to Full Text for this item Link to SFX for this item
3. Makino, K. "A linear time algorithm for recognizing regular Boolean functions." Journal of algorithms 43.2 (2002): 155-176. Link to SFX for this item
4. Frankl, P. "Canonical antichains on the circle and applications." SIAM journal on discrete mathematics 3.3 (1990): 355-363. Link to SFX for this item
5. Iwama, K. "Reductions for monotone Boolean circuits." Theoretical computer science 408.2/3 (2008): 208-212. Link to SFX for this item
6. Hilton, A. W. "Some intersection theorems for systems of finite sets." The quarterly journal of mathematics 18.1 (1967): 369-384. Link to Full Text for this item Link to SFX for this item
Select All Clear All

Expand list of advanced services Advanced
A service provided by the Library of the Wissenschaftspark Albert Einstein, Potsdam, Germany.
© 2005 SFX by Ex Libris Inc.