Log in

Relevant bibliographies by topics / ANALYSIS OF BOOLEAN FUNCTIONS

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'ANALYSIS OF BOOLEAN FUNCTIONS'

Author: Grafiati

Published: 4 June 2021

Last updated: 5 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'ANALYSIS OF BOOLEAN FUNCTIONS.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "ANALYSIS OF BOOLEAN FUNCTIONS"

1

Huang, Jing Lian, Su Duo Li, Yong Liu, and Ke Yan Deng. "On Analysis and Judgment of Balance for Boolean Functions by E-Derivative." Applied Mechanics and Materials 643 (September 2014): 130–35. http://dx.doi.org/10.4028/www.scientific.net/amm.643.130.

Full text

Abstract:

Using the derivative of the Boolean function and the e-derivative defined by ourselves as research tools and deeply into the internal structure of Boolean, we study the issues of the analysis and judgment of balance for Boolean functions. We get that the linear functions and the nonzero derivative of the product of two linear functions are balanced functions, and the product of two linear functions are not balanced functions. We also obtain the quadratic homogeneous Booleans are not all balanced function. Besides, we deduce the theorem which determine the sum of linear function and balanced fu

APA, Harvard, Vancouver, ISO, and other styles

2

Charpin, Pascale. "Normal Boolean functions." Journal of Complexity 20, no. 2-3 (2004): 245–65. http://dx.doi.org/10.1016/j.jco.2003.08.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mitton, Michel. "On Boolean bent functions." Journal of Discrete Mathematical Sciences and Cryptography 12, no. 3 (2009): 323–33. http://dx.doi.org/10.1080/09720529.2009.10698239.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Meng, QingShu, HuanGuo Zhang, Min Yang, and ZhangYi Wang. "Analysis of affinely equivalent Boolean functions." Science in China Series F: Information Sciences 50, no. 3 (2007): 299–306. http://dx.doi.org/10.1007/s11432-007-0030-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ovchinnikov, Sergei. "Boolean Representation of Manifolds and Functions." Journal of Mathematical Analysis and Applications 263, no. 1 (2001): 294–300. http://dx.doi.org/10.1006/jmaa.2001.7647.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Zelenetsky, A. S., and P. G. Klyucharev. "Boolean Functions with Affine Annihilators." Mathematics and Mathematical Modeling, no. 6 (April 28, 2021): 1–12. http://dx.doi.org/10.24108/mathm.0620.0000246.

Full text

Abstract:

In the article we study boolean functions with affine annihilators. We have obtained results in both, estimating the number of functions under study and defining the relationship between Walsh-Hadamard coefficients of an arbitrary boolean function and its affine annihilator available. The second section of this article focuses on estimating the number of boolean functions with affine annihilators. The value has top and bottom bound. Besides, we have obtained the asymptotic estimate of the number of boolean functions with affine annihilators. The third section studies the Walsh-Hadamard coeffic

APA, Harvard, Vancouver, ISO, and other styles

7

Joel, Ratsaby. "Density of smooth Boolean functions." Applicable Analysis and Discrete Mathematics 1, no. 1 (2007): 184–98. http://dx.doi.org/10.2298/aadm0701184r.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Vinokurov, S. F., and N. A. Peryazev. "Polynomial expansions of Boolean functions with respect to nondegenerate functions." Algebra and Logic 30, no. 6 (1991): 411–16. http://dx.doi.org/10.1007/bf02018736.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Green, Ben, and Tom Sanders. "Boolean Functions with small Spectral Norm." Geometric and Functional Analysis 18, no. 1 (2008): 144–62. http://dx.doi.org/10.1007/s00039-008-0654-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lafitte, Frédéric, Dirk,Van Heule, and Julien,Van hamme. "Cryptographic Boolean Functions with R." R Journal 3, no. 1 (2011): 44. http://dx.doi.org/10.32614/rj-2011-007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "ANALYSIS OF BOOLEAN FUNCTIONS"

1

Fuller, Joanne Elizabeth. "Analysis of Affine Equivalent Boolean Functions for Cryptography." Queensland University of Technology, 2003. http://eprints.qut.edu.au/15828/.

Full text

Abstract:

Boolean functions are an important area of study for cryptography. These functions, consisting merely of one's and zero's, are the heart of numerous cryptographic systems and their ability to provide secure communication. Boolean functions have application in a variety of such systems, including block ciphers, stream ciphers and hash functions. The continued study of Boolean functions for cryptography is therefore fundamental to the provision of secure communication in the future. This thesis presents an investigation into the analysis of Boolean functions and in particular, analysis of affine

APA, Harvard, Vancouver, ISO, and other styles

2

Gröpl, Clemens. "Binary Decision Diagrams for Random Boolean Functions." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 1999. http://dx.doi.org/10.18452/14357.

Full text

Abstract:

Binary Decision Diagrams (BDDs) sind eine Datenstruktur für Boolesche Funktionen, die auch unter dem Namen branching program bekannt ist. In ordered binary decision diagrams (OBDDs) müssen die Tests einer festen Variablenordnung genügen. In free binary decision diagrams (FBDDs) darf jede Variable höchstens einmal getestet werden. Die Effizienz neuer Varianten des BDD-Konzepts wird gewöhnlich anhand spektakulärer (worst-case) Beispiele aufgezeigt. Wir verfolgen einen anderen Ansatz und vergleichen die Darstellungsgrößen für fast alle Booleschen Funktionen. Während I. Wegener bewiesen

APA, Harvard, Vancouver, ISO, and other styles

3

Ono, Hirotaka. "Structural Studies of Boolean Functions with Applications to Data Analysis." 京都大学 (Kyoto University), 2002. http://hdl.handle.net/2433/149747.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Makino, Kazuhisa. "Studies on Positive and Horn Boolean Functions with Applications to Data Analysis." Kyoto University, 1997. http://hdl.handle.net/2433/202286.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Etherington, Carole J. "An analysis of cryptographically significant Boolean functions with high correlation immunity by reconfigurable computer." Thesis, Monterey, California. Naval Postgraduate School, 2010. http://hdl.handle.net/10945/5003.

Full text

Abstract:

Approved for public release; distribution is unlimited<br>Boolean functions with high correlation immunity can be used in cryptosystems to defend against correlation attacks. These functions are rare and difficult to find. As the variables increase, this task becomes exponentially more complex and time consuming. Three different ways to execute a program to find the correlation immunity of a function are compared in this thesis. First, a program was written in C and executed on a conventional CPU. The same program was then executed on an FPGA on the SRC-6 reconfigurable computer. A similar pro

APA, Harvard, Vancouver, ISO, and other styles

6

Christie, Lee A. "The role of Walsh structure and ordinal linkage in the optimisation of pseudo-Boolean functions under monotonicity invariance." Thesis, Robert Gordon University, 2016. http://hdl.handle.net/10059/1567.

Full text

Abstract:

Optimisation heuristics rely on implicit or explicit assumptions about the structure of the black-box fitness function they optimise. A review of the literature shows that understanding of structure and linkage is helpful to the design and analysis of heuristics. The aim of this thesis is to investigate the role that problem structure plays in heuristic optimisation. Many heuristics use ordinal operators; which are those that are invariant under monotonic transformations of the fitness function. In this thesis we develop a classification of pseudo-Boolean functions based on rank-invariance. Th

APA, Harvard, Vancouver, ISO, and other styles

7

Yildirim, Hamdi Murat. "Algebraic Properties Of The Operations Used In Block Cipher Idea." Phd thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/3/12608289/index.pdf.

Full text

Abstract:

In this thesis we obtain several interesting algebraic properties of the operations used in the block cipher IDEA which are important for cryptographic analyzes. We view each of these operations as a function from $mathbb Z_{2}^n times mathbb Z_{2}^n to mathbb Z_{2}^n$. By fixing one of variables $v(z)=mathbf Z$ in $mathbb Z_{2}^n times mathbb Z_{2}^n$, we define functions $mathbf {f}_z$ and $mathbf {g}_z$ from $mathbb Z_{2}^n$ to $mathbb Z_{2}^n$ for the addition $BIGboxplus$ and the multiplication $BIGodot$ operations, respectively. We first show that the nonlinearity of $mathbf {g}_z$ rema

APA, Harvard, Vancouver, ISO, and other styles

8

Amaral, Amaury de Souza. "Análise de funções booleanas e engenharia reversa em jogos." reponame:Repositório Institucional da UFABC, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Oliveira, Gabriela Martins Gonçalves de. "Ajuste de parâmetros em algoritmos de aprendizado de máquina utilizando transferência de aprendizado." reponame:Repositório Institucional da UFABC, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Sagdicoglu, Serhat. "Cryptological Viewpoint Of Boolean Functions." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/1082403/index.pdf.

Full text

Abstract:

Boolean functions are the main building blocks of most cipher systems. Various aspects of their cryptological characteristics are examined and investigated by many researchers from different fields. This thesis has no claim to obtain original results but consists in an attempt at giving a unified survey of the main results of the subject. In this thesis, the theory of boolean functions is presented in details, emphasizing some important cryptological properties such as balance, nonlinearity, strict avalanche criterion and propagation criterion. After presenting many results about these criteri

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "ANALYSIS OF BOOLEAN FUNCTIONS"

1

Lam, William K. C. Timed Boolean Functions: A Unified Formalism for Exact Timing Analysis. Springer US, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lam, William K. C. Timed Boolean functions: A unified formalism for exact timing analysis. Kluwer Academic Publishers, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Vlad, Serban E., ed. Boolean Functions. John Wiley & Sons, Inc., 2019. http://dx.doi.org/10.1002/9781119517528.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Schneeweiss, Winfrid G. Boolean Functions. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-45638-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lam, William K. C., and Robert K. Brayton. Timed Boolean Functions. Springer US, 1994. http://dx.doi.org/10.1007/978-1-4615-2688-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kusraev, A. G. Boolean valued analysis. Kluwer Academic, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kusraev, A. G., and S. S. Kutateladze. Boolean Valued Analysis. Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-011-4443-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Boolean algebras in analysis. Kluwer Academic, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Vladimirov, D. A. Boolean Algebras in Analysis. Springer Netherlands, 2002. http://dx.doi.org/10.1007/978-94-017-0936-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Clote, Peter. Boolean Functions and Computation Models. Springer Berlin Heidelberg, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "ANALYSIS OF BOOLEAN FUNCTIONS"

1

Schneeweiss, Winfrid G. "Diagrams for Boolean Analysis." In Boolean Functions. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-45638-1_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yarlagadda, R. K. Rao, and John E. Hershey. "Boolean Functions." In Hadamard Matrix Analysis and Synthesis. Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6313-6_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Schneeweiss, Winfrid G. "Some Algorithms and Computer Programs for Boolean Analysis." In Boolean Functions. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-45638-1_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Jukna, Stasys. "Analysis of Boolean Functions." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24508-4_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kramosil, Ivan. "Boolean—Valued and Boolean—Like Processed Belief Functions." In Probabilistic Analysis of Belief Functions. Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-0587-7_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kramosil, Ivan. "Boolean Combinations of Set-Valued Random Variables." In Probabilistic Analysis of Belief Functions. Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-0587-7_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Howe, Jacob M., and Andy King. "Implementing Groundness Analysis with Definite Boolean Functions." In Programming Languages and Systems. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-46425-5_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Escazut, Cathy, and Philippe Collard. "Typology of Boolean Functions Using Walsh Analysis." In Artificial Neural Nets and Genetic Algorithms. Springer Vienna, 1995. http://dx.doi.org/10.1007/978-3-7091-7535-4_43.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Armstrong, Tania, Kim Marriott, Peter Schachte, and Harald Søndergaard. "Boolean functions for dependency analysis: Algebraic properties and efficient representation." In Static Analysis. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58485-4_46.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Shparlinski, Igor. "Special Polynomials and Boolean Functions." In Cryptographic Applications of Analytic Number Theory. Birkhäuser Basel, 2003. http://dx.doi.org/10.1007/978-3-0348-8037-4_32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "ANALYSIS OF BOOLEAN FUNCTIONS"

1

Rafiq, H. M., and M. U. Siddiqi. "Analysis of Autocorrelation Function of Boolean Functions in Haar Domain." In 2016 International Conference on Computer and Communication Engineering (ICCCE). IEEE, 2016. http://dx.doi.org/10.1109/iccce.2016.34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kumar, Ashok V., and Jongho Lee. "Boolean Algebra and Analysis Using Approximate Step Functions." In ASME 2004 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/detc2004-57700.

Full text

Abstract:

Implicit equations of curves and surfaces have been shown to be useful for constructing solutions for boundary value problems such that the boundary conditions are satisfied exactly. This application has generated interest in constructing solid models where the geometry is represented using implicit equations rather than parametric equations. In this paper we present a method for constructing step functions of solids that have a unit value within the solid and zero outside. A level set of this step function can then be defined as the boundary of the solid. This step function can be used not on

APA, Harvard, Vancouver, ISO, and other styles

3

O'Donnell, Ryan. "Some topics in analysis of boolean functions." In the 40th annual ACM symposium. ACM Press, 2008. http://dx.doi.org/10.1145/1374376.1374458.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Shafat, Gabriel, Binyamin Abramov, and Ilya Levin. "Using Threshold Functions in Teaching Electronics." In ASME 2008 9th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2008. http://dx.doi.org/10.1115/esda2008-59125.

Full text

Abstract:

Teaching of digital electronics and the teaching of analog electronics differ significantly. The methods in use today differ in two major points: the required mathematical background and the used didactic methods. The well-known gap between the analog and the digital paradigms in teaching electronics has motivated the present study. The paper introduces a novel approach for electronics course teaching. The approach uses a concept threshold functions. Threshold functions have three remarkable properties that are suitable for the purposes of teaching an electronics course. The first property is

APA, Harvard, Vancouver, ISO, and other styles

5

Franco, Maria A., Natalio Krasnogor, and Jaume Bacardit. "Analysing bioHEL using challenging boolean functions." In the 12th annual conference comp. ACM Press, 2010. http://dx.doi.org/10.1145/1830761.1830817.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Chauvin, Brigitte, Danièle Gardy, and Cécile Mailler. "The growing tree distribution on Boolean functions." In 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). Society for Industrial and Applied Mathematics, 2011. http://dx.doi.org/10.1137/1.9781611973013.5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Blechschmidt, James L., and Chung-Hsing Lee. "The Design and Analysis of Cam Profiles Using Algebraic Functions." In ASME 1991 Design Technical Conferences. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/detc1991-0150.

Full text

Abstract:

Abstract A new method for the design and analysis of cam profiles is developed and demonstrated in this paper using algebraic functions in two variables. A technique for the construction of the cam profile directly without using the lift curve is developed. The basis for this analysis is the use of Boolean operators in algebra using a form of algebraic function called the defining function. Using simple quadratic curves such as circles, ellipses, and slabs, more complicated cam profiles are constructed using the Boolean operators of union, intersection, and difference. The resulting closed alg

APA, Harvard, Vancouver, ISO, and other styles

8

Rafiq, H. M., and M. U. Siddiqi. "Analysis and synthesis of cryptographic Boolean functions in Haar domain: Initial results." In 2012 International Conference on Computer and Communication Engineering (ICCCE). IEEE, 2012. http://dx.doi.org/10.1109/iccce.2012.6271250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Moraglio, Alberto, Andrea Mambrini, and Luca Manzoni. "Runtime analysis of mutation-based geometric semantic genetic programming on boolean functions." In the twelfth workshop. ACM Press, 2013. http://dx.doi.org/10.1145/2460239.2460251.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Long, Hui-yun, and Jian-shi Li. "Notice of Violation of IEEE Publication Principles: Boolean Functions for Pair Sharing Analysis." In 2009 International Conference on Networking and Digital Society (ICNDS). IEEE, 2009. http://dx.doi.org/10.1109/icnds.2009.66.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "ANALYSIS OF BOOLEAN FUNCTIONS"

1

Stanica, Pantelimon, Thor Martinsen, Sugata Gangopadhyay, and Brajesh K. Singh. Bent and Generalized Bent Boolean Functions. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada574574.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Gupta, Aarti, and Allan L. Fisher. Representation and Manipulation of Inductive Boolean Functions. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada256078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Shafer, J. L., S. W. Schneider, J. T. Butler, and P. Stanica. Enumeration of Bent Boolean Functions by Reconfigurable Computer. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada547661.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Falkowski, Bogdan. Spectral Methods for Boolean and Multiple-Valued Input Logic Functions. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.1151.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Mahooti, Rabe'eh. A CMOS circuit generator using differential pass transistors for implementing Boolean functions. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.5689.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Stanica, Pantelimon. Affine Equivalence of Quartic Monomial Rotation Symmetric Boolean Functions in Prime Power Dimension. Defense Technical Information Center, 2015. http://dx.doi.org/10.21236/ada625138.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kailath, Thomas. Recursive Analysis of Matrix Scattering Functions. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada277264.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Sharpley, Robert C., and Veseelin Vatchev. Analysis of the Intrinsic Mode Functions. Defense Technical Information Center, 2004. http://dx.doi.org/10.21236/ada637116.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Osipov, Andrei. Non-asymptotic Analysis of Bandlimited Functions. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada555158.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Damera, Prateen. A low level analysis of Cellular Automata and Random Boolean Networks as a computational architecture. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.670.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!