MIEKTORE WLASNOSCE ZBIOROW PODFUNKCJI FUNKCJI BOOLOWSKICH. = PROPRIETES DES SOUS-FONCTIONS DES FONCTIONS BOOLEENNESKERNTOPF P.1974; WARSZAWA; PAUSTW. WYDAWN. NAUK.; DA. 1974; PP. 1-77; ABS. ANGL. RUSSE; BIBL. 4 P. 1/2Book

ETUDE D'UNE ALGEBRE BOOLEENNE TEMPORELLESIFAKIS J.1972; C.R. ACAD. SCI., A; FR.; DA. 1972; VOL. 275; NO 25; PP. 1343-1346; BIBL. 1 REF.Serial Issue

On the positive and the inversion complexity of Boolean functionsDICIUNAS, V.Informatique théorique et applications (Imprimé). 1993, Vol 27, Num 4, pp 283-293, issn 0988-3754Article

On a class of boolean functions with matroid propertyGAROCHE, F; LEONARD, M.Discrete mathematics. 1984, Vol 49, Num 3, pp 323-325, issn 0012-365XArticle

Activities and sensitivities in Boolean network modelsSHMULEVICH, Ilya; KAUFFMAN, Stuart A.Physical review letters. 2004, Vol 93, Num 4, pp 048701.1-048701.4, issn 0031-9007Article

Simplification of boolean functions through petri netsHURA, G. S.Microelectronics and reliability. 1983, Vol 23, Num 3, pp 467-470, issn 0026-2714Article

Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean FunctionsLEI HU; XIANGYONG ZENG.Lecture notes in computer science. 2006, pp 402-416, issn 0302-9743, isbn 3-540-44523-4, 1Vol, 15 p.Conference Paper

Binary-decision graphs for implementation of boolean functionsSILVA, M; DAVID, R.IEE proceedings. Part E. Computers and digital techniques. 1985, Vol 132, Num 3, pp 175-184, issn 0143-7062Article

Number and length of attractors in a critical kauffman model with connectivity oneDROSSEL, Barbara; MIHALJEV, Tamara; GREIL, Florian et al.Physical review letters. 2005, Vol 94, Num 8, pp 088701.1-088701.4, issn 0031-9007Article

A Boolean function requiring 3n network sizeBLUM, N.Theoretical computer science. 1984, Vol 28, Num 3, pp 337-345, issn 0304-3975Article

r-Universal reversible logic gatesDE VOS, A; STORME, L.Journal of physics. A, mathematical and general. 2004, Vol 37, Num 22, pp 5815-5824, issn 0305-4470, 10 p.Article

A general dimension for approximately learning boolean functionsKÖBLER, Johannes; LINDNER, Wolfgang.Lecture notes in computer science. 2002, pp 139-148, issn 0302-9743, isbn 3-540-00170-0, 10 p.Conference Paper

The nonhomomorphicity of Boolean functionsZHANG, X.-M; YULIANG ZHENG.Lecture notes in computer science. 1999, pp 280-295, issn 0302-9743, isbn 3-540-65894-7Conference Paper

Improving bounds for the number of correlation immune Boolean functionsSUNG MO PARK; LEE, S; SOO HAK SUNG et al.Information processing letters. 1997, Vol 61, Num 4, pp 209-212, issn 0020-0190Article

Bounds on the number of functions satisfying the Strict Avalanche CriterionCUSICK, T. W.Information processing letters. 1996, Vol 57, Num 5, pp 261-263, issn 0020-0190Article

Cryptanalysis of tree-structured ciphersMILLAN, W; DAWSON, E. P; O'CONNOR, L. J et al.Electronics Letters. 1994, Vol 30, Num 12, pp 941-942, issn 0013-5194Article

Improvements on Khrapchenko's theoremKOUTSOUPIAS, E.Theoretical computer science. 1993, Vol 116, Num 2, pp 399-403, issn 0304-3975Article

Approximation et formation précise des fonctions booléennes de plusieurs variables. I. Volume de mémoire et précision de l'approximationRADCHENKO, A. N.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 1, pp 148-156, issn 0002-3388Article

An Ω(n^4/3) lower bound on the monotone network complexity of the n^th degree convolutionBLUM, N.Theoretical computer science. 1985, Vol 36, Num 1, pp 59-69, issn 0304-3975Article

Bounded-depth, polynomial-size circuits for symmetric functionsFAGIN, R; KLAWE, M. M; PIPPENGER, N. J et al.Theoretical computer science. 1985, Vol 36, Num 2-3, pp 239-250, issn 0304-3975Article

Complex Boolean networks obtained by diagonalizationSCARPELLIN, B.Theoretical computer science. 1985, Vol 36, Num 1, pp 119-125, issn 0304-3975Article

Connection-graph and iteration graph of monotone boolean functionsROBERT, Y; TCHUENTE, M.Discrete applied mathematics. 1985, Vol 11, Num 3, pp 245-253, issn 0166-218XArticle

Maximizing a supermodular pseudoboolean function: a polynomial algorithm for supermodular cubic functionBILLIONNET, A; MINOUX, M.Discrete applied mathematics. 1985, Vol 12, Num 1, pp 1-11, issn 0166-218XArticle

A 4n-lower bound on the monotone network complexity of a one-output Boolean functionTIEKENHEINRICH, J.Information processing letters. 1984, Vol 18, Num 4, pp 201-202, issn 0020-0190Article

Area-time optimal fast implementation of several functions in a VLSI modelWADA, K; HAGIHARA, K.'I; TOKURA, N et al.IEEE transactions on computers. 1984, Vol 33, Num 5, pp 455-462, issn 0018-9340Article