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

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

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

Two memristors suffice to compute all Boolean functionsLEHTONEN, E; POIKONEN, J. H; LAIHO, M et al.Electronics letters. 2010, Vol 46, Num 3, pp 230-231, issn 0013-5194, 2 p.Article

On the robustness of NK-Kauffman networks against changes in their connections and Boolean functionsZERTUCHE, Federico.Journal of mathematical physics. 2009, Vol 50, Num 4, issn 0022-2488, 042513.1-042513.11Article

Annual International Symposium on Algorithms and ComputationFLEISCHER, Rudolf.Algorithmica. 2006, Vol 46, Num 1, issn 0178-4617, 148 p.Conference Proceedings

Bounded-width polynomial-size Boolean formulas compute exactly those functions in AC⁰ISTRAIL, S; ZIVKOVIC, D.Information processing letters. 1994, Vol 50, Num 4, pp 211-216, issn 0020-0190Article

A Boolean neural network approach for the traveling salesman problemSHIRISH BHIDE; JOHN, N; KABUKA, M. R et al.IEEE transactions on computers. 1993, Vol 42, Num 10, pp 1271-1278, issn 0018-9340Article

Critical values in asynchronous random Boolean NetworksMESOT, Bertrand; TEUSCHER, Christof.Lecture notes in computer science. 2003, pp 367-376, issn 0302-9743, isbn 3-540-20057-6, 10 p.Conference Paper

Counting satisfiable k-CNF formulasHARRIS, Mitchell A.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42863-1, p. 765Conference Paper

Functions that are read-once on a subset of their inputsHELLESTEIN, L.Discrete applied mathematics. 1993, Vol 46, Num 3, pp 235-251, issn 0166-218XArticle

Nearly optimal hierarchies for network and formula sizePATERSON, M. S; WEGENER, I.Acta informatica. 1986, Vol 23, Num 2, pp 217-221, issn 0001-5903Article

Cubic Boolean functions with highest resiliencyCARLET, Claude; CHARPIN, Pascale.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 497Conference Paper

Recognition and dualization of disguised bidual Horn functionsEITER, Thomas; IBARAKI, Toshihide; MAKINO, Kazuhisa et al.Information processing letters. 2002, Vol 82, Num 6, pp 283-291, issn 0020-0190Article

Cryptanalysis of the modified version of the hash function proposed at PKC'98DAEWAN HAN; SANGWOO PARK; SEONGTAEK CHEE et al.Lecture notes in computer science. 2002, pp 252-262, issn 0302-9743, isbn 3-540-44009-7, 11 p.Conference Paper

Special Issue: Boolean Functions and Related ProblemsHAMMER, Peter L.Discrete applied mathematics. 2000, Vol 107, Num 1-3, issn 0166-218X, 263 p.Serial Issue

Global avalanche characteristics and propagation criterion of balanced Boolean functionsSOO HAK SUNG; SEONGTAEK CHEE; CHOONSIK PARK et al.Information processing letters. 1999, Vol 69, Num 1, pp 21-24, issn 0020-0190Article

Sur le critère de propagation de degré l et d'ordre k = On the propagation criterion of degree l and order kCARLET, C.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1998, Vol 326, Num 7, pp 891-896, issn 0764-4442Article

On the size of a neighbourhood of the first rankTOMAN, E.Computers and artificial intelligence. 1993, Vol 12, Num 2, pp 123-130, issn 0232-0274Article

Almost security of cryptographic Boolean functionsKUROSAWA, Kaoru; MATSUMOTO, Ryutaroh.IEEE transactions on information theory. 2004, Vol 50, Num 11, pp 2752-2761, issn 0018-9448, 10 p.Article

On the representation of Boolean predicates of the Diffie-Hellman functionKILTZ, Eike.Lecture notes in computer science. 2003, pp 223-233, issn 0302-9743, isbn 3-540-00623-0, 11 p.Conference Paper

Average-case complexity of partial Boolean functionsCHASHKIN, Alexander.Lecture notes in computer science. 2003, pp 146-156, issn 0302-9743, isbn 3-540-20103-3, 11 p.Conference Paper

Limiting negations in bounded-depth circuits: An extension of Markov's theoremSHAO CHIN SUNG; TANAKA, Keisuke.Lecture notes in computer science. 2003, pp 108-116, issn 0302-9743, isbn 3-540-20695-7, 9 p.Conference Paper