Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Función booliana")

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 1835

  • Page / 74


Selection :

  • and

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

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

An explicit lower bound of 5n - o(n) for Boolean circuitsIWAMA, Kazuo; MORIZUMI, Hiroki.Lecture notes in computer science. 2002, pp 353-364, issn 0302-9743, isbn 3-540-44040-2, 12 p.Conference Paper

Correlation properties of combiners with memory in stream ciphersMEIER, W; STAFFELBACH, O.Journal of cryptology. 1992, Vol 5, Num 1, pp 67-86, issn 0933-2790Conference Paper

On the relevance of the strict avalance criterionBABBAGE, S.Electronics Letters. 1990, Vol 26, Num 7, pp 461-462, issn 0013-5194, 2 p.Article

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 AC0ISTRAIL, 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

On the sensitivity to noise of a Boolean functionMATACHE, Mihaela T; MATACHE, Valentin.Journal of mathematical physics. 2009, Vol 50, Num 10, issn 0022-2488, 103512.1-103512.15Article

On converting CNF to DNFMILTERSEN, Peter Bro; RADHAKRISHNAN, Jaikumar; WEGENER, Ingo et al.Lecture notes in computer science. 2003, pp 612-621, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

LILI keystream generatorSIMPSON, Leonie Ruth; DAWSON, E; GOLIC, J et al.Lecture notes in computer science. 2001, pp 248-261, issn 0302-9743, isbn 3-540-42069-XConference Paper

Nonlinearity and propagation characteristics of balanced boolean functionsSEBERRY, J; XIAN-MO ZHANG; YULIANG ZHENG et al.Information and computation (Print). 1995, Vol 119, Num 1, pp 1-13, issn 0890-5401Article

A growth algorithm for neural network decision treesGOLEA, M; MARCHAND, M.Europhysics letters (Print). 1990, Vol 12, Num 3, pp 205-210, issn 0295-5075Article

Negation is powerless for boolean slice functionsVALIANT, L. G.SIAM journal on computing (Print). 1986, Vol 15, Num 2, pp 531-535, issn 0097-5397Article

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

  • Page / 74