Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Fonction booléenne")


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2623

  • Page / 105


Selection :

  • and

Minimization of Boolean functions of any number of variables using decimal labelsMALAY SEN.Information sciences. 1983, Vol 30, Num 1, pp 37-45, issn 0020-0255Article

A measure in which boolean negation is exponentially powerfulSKYUM, S.Information processing letters. 1983, Vol 17, Num 3, pp 125-128, issn 0020-0190Article


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

Improving the nonlinearity of certain balanced Boolean functions with good local and global avalanche characteristicsSTANICA, Pantelimon; SOO HAK SUNG.Information processing letters. 2001, Vol 79, Num 4, pp 167-172, issn 0020-0190Article

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

A survey of some recent results on Bent functionsDOBBERTIN, Hans; LEANDER, Gregor.Lecture notes in computer science. 2005, pp 1-29, issn 0302-9743, isbn 3-540-26084-6, 29 p.Conference Paper

On the complexity of slice functionsWEGENER, I.Theoretical computer science. 1985, Vol 38, Num 1, pp 55-68, issn 0304-3975Article

Linear equations and interpolation in Boolean algebraMELTER, R. A; RUDEANU, S.Linear algebra and its applications. 1984, Vol 57, pp 31-40, issn 0024-3795Article

Computation of boolean functions on networks of binary automataTCHUENTE, M.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 269-277, issn 0022-0000Article

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

A 4n lower bound on the combinatorial complexity of certain symmetric boolean functions over the basis of unate dyadic boolean functionsZWICK, U.SIAM journal on computing (Print). 1991, Vol 20, Num 3, pp 499-505, issn 0097-5397Article

A theory of coteries: mutual exclusion in distributed systemsIBARAKI, T; KAMEDA, T.IEEE transactions on parallel and distributed systems. 1993, Vol 4, Num 7, pp 779-794, issn 1045-9219Article

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

  • Page / 105