Faster access than browser!
123 relations: Algebraic normal form, Alternating Turing machine, Analysis of Boolean functions, Anatoly Shalyto, And-inverter graph, Artificial neuron, Atlas.ti, Balanced boolean function, Bella Subbotovskaya, Bent function, Bill of material based on characteristics, Binary data, Binary decision diagram, Bit blit, Blum's speedup theorem, Boole's expansion theorem, Boolean, Boolean algebra, Boolean algebra (structure), Boolean algebras canonically defined, Boolean circuit, Boolean differential calculus, Boolean flag, Boolean network, Boolean operation, Boolean-valued function, Canonical normal form, Certificate (complexity), Characteristic based product configurator, Circuit (computer science), Circuit complexity, Colossus computer, Completeness (cryptography), Complexity index, Concept class, Cooperative game theory, Correlation attack, Correlation immunity, Decision tree model, Dedekind number, Disjunctive normal form, Double exponential function, Error tolerance (PAC learning), Espresso heuristic logic minimizer, Evasive Boolean function, Exclusive or, Functional completeness, Gene regulatory network, George Boole, Glossary of computer graphics, ..., Greenpilot, Implicant, Intuitionistic logic, Iverson bracket, Lattice gas automaton, Linear separability, List of Boolean algebra topics, List of Russian IT developers, List of Russian mathematicians, List of terms relating to algorithms and data structures, Logic alphabet, Logic gate, Logic optimization, Logical conjunction, Logical connective, Logical consequence, Logical disjunction, Logical equality, Logical NOR, Lookup table, Lupanov representation, Material conditional, Median algebra, NAND gate, NanGate, Natural proof, Oded Schramm, Outline of algebra, Outline of logic, Parasolid, Parity function, Partitioning cryptanalysis, Perceptrons (book), Permutation box, Polynomial hierarchy, Post's lattice, Probability bounds analysis, Product term, Property testing, Propositional calculus, Propositional directed acyclic graph, Propositional variable, Pseudo-Boolean function, Quantifier (logic), Quantum optimization algorithms, Quine–McCluskey algorithm, Read-once function, Reed–Muller expansion, Reversible computing, Rvachev function, S-box, Sample exclusion dimension, Schwartz–Zippel lemma, SEED, Sheffer stroke, Sigil (computer programming), Sparse distributed memory, Stream cipher, Symmetric Boolean function, Symmetric difference, T-function, Tautology (logic), Three-valued logic, Toffoli gate, Truth function, Truth table, Truth-table reduction, Two-element Boolean algebra, UML state machine, Unate function, Yuri Zhuravlyov (mathematician), Zero-suppressed decision diagram, Zhegalkin polynomial. Expand index (73 more) »
Algebraic normal form
In Boolean algebra, the algebraic normal form (ANF), ring sum normal form (RSNF or RNF), Zhegalkin normal form, or Reed–Muller expansion is a way of writing logical formulas in one of three subforms.
New!!: Boolean function and Algebraic normal form · See more »
Alternating Turing machine
In computational complexity theory, an alternating Turing machine (ATM) is a non-deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP.
New!!: Boolean function and Alternating Turing machine · See more »
Analysis of Boolean functions
In mathematics and theoretical computer science, analysis of Boolean functions is the study of real-valued functions on \^n or \^n from a spectral perspective (such functions are sometimes known as pseudo-Boolean functions).
New!!: Boolean function and Analysis of Boolean functions · See more »
Anatoly Shalyto
Anatoly Abramovich Shalyto (Анато́лий Абра́мович Шалы́то, May 28, 1948 in Leningrad, Soviet Union) is a Russian scientist, doctor of sciences, professor, awarded by Russian State Government in 2008 for achievements in education, developer of technology for Automata-based programming named "Switch-technology", initiator of and of.
New!!: Boolean function and Anatoly Shalyto · See more »
And-inverter graph
An and-inverter graph (AIG) is a directed, acyclic graph that represents a structural implementation of the logical functionality of a circuit or network.
New!!: Boolean function and And-inverter graph · See more »
Artificial neuron
An artificial neuron is a mathematical function conceived as a model of biological neurons, a neural network.
New!!: Boolean function and Artificial neuron · See more »
Atlas.ti
ATLAS.ti is a computer program used mostly, but not exclusively, in qualitative research or qualitative data analysis.
New!!: Boolean function and Atlas.ti · See more »
Balanced boolean function
In mathematics and computer science, a balanced boolean function is a boolean function whose output yields as many 0s as 1s over its input set.
New!!: Boolean function and Balanced boolean function · See more »
Bella Subbotovskaya
Bella Abramovna Subbotovskaya (b. 1938 - d. 23 September 1982) was a Soviet mathematician who founded the short-lived Jewish People's University (1978–1983) in Moscow.
New!!: Boolean function and Bella Subbotovskaya · See more »
Bent function
In the mathematical field of combinatorics, a bent function is a special type of Boolean function.
New!!: Boolean function and Bent function · See more »
Bill of material based on characteristics
The composition of a product can be represented using a directed acyclic graph, called real structure, in which every node is an aggregation of its children nodes.
New!!: Boolean function and Bill of material based on characteristics · See more »
Binary data
Binary data is data whose unit can take on only two possible states, traditionally termed 0 and +1 in accordance with the binary numeral system and Boolean algebra.
New!!: Boolean function and Binary data · See more »
Binary decision diagram
In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function.
New!!: Boolean function and Binary decision diagram · See more »
Bit blit
Bit blit (also written BITBLT, BIT BLT, BitBLT, Bit BLT, Bit Blt etc., which stands for bit block transfer) is a data operation commonly used in computer graphics in which several bitmaps are combined into one using a boolean function.
New!!: Boolean function and Bit blit · See more »
Blum's speedup theorem
In computational complexity theory, Blum's speedup theorem, first stated by Manuel Blum in 1967, is a fundamental theorem about the complexity of computable functions.
New!!: Boolean function and Blum's speedup theorem · See more »
Boole's expansion theorem
Boole's expansion theorem, often referred to as the Shannon expansion or decomposition, is the identity: F.
New!!: Boolean function and Boole's expansion theorem · See more »
Boolean
In most computer programming languages, a '''Boolean''' data type is a data type with only two possible values: true or false.
New!!: Boolean function and Boolean · See more »
Boolean algebra
In mathematics and mathematical logic, Boolean algebra is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 respectively.
New!!: Boolean function and Boolean algebra · See more »
Boolean algebra (structure)
In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice.
New!!: Boolean function and Boolean algebra (structure) · See more »
Boolean algebras canonically defined
Boolean algebra is a mathematically rich branch of abstract algebra.
New!!: Boolean function and Boolean algebras canonically defined · See more »
Boolean circuit
In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for digital logic circuits.
New!!: Boolean function and Boolean circuit · See more »
Boolean differential calculus
Boolean differential calculus (BDC) (German: Boolescher Differentialkalkül (BDK)) is a subject field of Boolean algebra discussing changes of Boolean variables and Boolean functions.
New!!: Boolean function and Boolean differential calculus · See more »
Boolean flag
A boolean flag, truth bit or truth flag in computer science is a Boolean value represented as one bit.
New!!: Boolean function and Boolean flag · See more »
Boolean network
A Boolean network consists of a discrete set of Boolean variables each of which has a Boolean function (possibly different for each variable) assigned to it which takes inputs from a subset of those variables and output that determines the state of the variable it is assigned to.
New!!: Boolean function and Boolean network · See more »
Boolean operation
Boolean operation or Boolean operator may mean.
New!!: Boolean function and Boolean operation · See more »
Boolean-valued function
A Boolean-valued function (sometimes called a predicate or a proposition) is a function of the type f: X → B, where X is an arbitrary set and where B is a Boolean domain, i.e. a generic two-element set, (for example B.
New!!: Boolean function and Boolean-valued function · See more »
Canonical normal form
In Boolean algebra, any Boolean function can be put into the canonical disjunctive normal form (CDNF) or minterm canonical form and its dual canonical conjunctive normal form (CCNF) or maxterm canonical form.
New!!: Boolean function and Canonical normal form · See more »
Certificate (complexity)
In computational complexity theory, a certificate (also called a witness) is a string that certifies the answer to a computation, or certifies the membership of some string in a language.
New!!: Boolean function and Certificate (complexity) · See more »
Characteristic based product configurator
A characteristic based product configurator is a product configurator extension which uses a set of discrete variables, called characteristics (or features), to define all possible product variations.
New!!: Boolean function and Characteristic based product configurator · See more »
Circuit (computer science)
In theoretical computer science, a circuit is a model of computation in which input values proceed through a sequence of gates, each of which computes a function.
New!!: Boolean function and Circuit (computer science) · See more »
Circuit complexity
In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of Boolean circuits that compute them.
New!!: Boolean function and Circuit complexity · See more »
Colossus computer
Colossus was a set of computers developed by British codebreakers in the years 1943–1945 to help in the cryptanalysis of the Lorenz cipher.
New!!: Boolean function and Colossus computer · See more »
Completeness (cryptography)
In cryptography, a boolean function is said to be complete if the value of each output bit depends on all input bits.
New!!: Boolean function and Completeness (cryptography) · See more »
Complexity index
Besides complexity intended as a difficulty to compute a function (see computational complexity), in modern computer science and in statistics another complexity index of a function stands for denoting its information content, in turn affecting the difficulty of learning the function from examples.
New!!: Boolean function and Complexity index · See more »
Concept class
A concept over a domain X is a total Boolean function over X. A concept class is a class of concepts.
New!!: Boolean function and Concept class · See more »
Cooperative game theory
In game theory, a cooperative game (or coalitional game) is a game with competition between groups of players ("coalitions") due to the possibility of external enforcement of cooperative behavior (e.g. through contract law).
New!!: Boolean function and Cooperative game theory · See more »
Correlation attack
In cryptography, correlation attacks are a class of known plaintext attacks for breaking stream ciphers whose keystream is generated by combining the output of several linear feedback shift registers (called LFSRs for the rest of this article) using a Boolean function.
New!!: Boolean function and Correlation attack · See more »
Correlation immunity
In mathematics, the correlation immunity of a Boolean function is a measure of the degree to which its outputs are uncorrelated with some subset of its inputs.
New!!: Boolean function and Correlation immunity · See more »
Decision tree model
In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an algorithm or communication process is considered to be basically a decision tree, i.e., a sequence of branching operations based on comparisons of some quantities, the comparisons being assigned the unit computational cost.
New!!: Boolean function and Decision tree model · See more »
Dedekind number
In mathematics, the Dedekind numbers are a rapidly growing sequence of integers named after Richard Dedekind, who defined them in 1897.
New!!: Boolean function and Dedekind number · See more »
Disjunctive normal form
In boolean logic, a disjunctive normal form (DNF) is a standardization (or normalization) of a logical formula which is a disjunction of conjunctive clauses; it can also be described as an OR of ANDs, a sum of products, or (in philosophical logic) a cluster concept.
New!!: Boolean function and Disjunctive normal form · See more »
Double exponential function
A double exponential function is a constant raised to the power of an exponential function.
New!!: Boolean function and Double exponential function · See more »
Error tolerance (PAC learning)
In PAC learning, error tolerance refers to the ability of an algorithm to learn when the examples received have been corrupted in some way.
New!!: Boolean function and Error tolerance (PAC learning) · See more »
Espresso heuristic logic minimizer
The Espresso logic minimizer is a computer program using heuristic and specific algorithms for efficiently reducing the complexity of digital electronic gate circuits.
New!!: Boolean function and Espresso heuristic logic minimizer · See more »
Evasive Boolean function
In mathematics, an evasive Boolean function ƒ (of n variables) is a Boolean function for which every decision tree algorithm has running time of exactly n.
New!!: Boolean function and Evasive Boolean function · See more »
Exclusive or
Exclusive or or exclusive disjunction is a logical operation that outputs true only when inputs differ (one is true, the other is false).
New!!: Boolean function and Exclusive or · See more »
Functional completeness
In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression.
New!!: Boolean function and Functional completeness · See more »
Gene regulatory network
A gene (or genetic) regulatory network (GRN) is a collection of molecular regulators that interact with each other and with other substances in the cell to govern the gene expression levels of mRNA and proteins.
New!!: Boolean function and Gene regulatory network · See more »
George Boole
George Boole (2 November 1815 – 8 December 1864) was a largely self-taught English mathematician, philosopher and logician, most of whose short career was spent as the first professor of mathematics at Queen's College, Cork in Ireland.
New!!: Boolean function and George Boole · See more »
Glossary of computer graphics
This is a glossary of terms relating computer graphics.
New!!: Boolean function and Glossary of computer graphics · See more »
Greenpilot
The online portal Greenpilot is a service provided by the German National Library of Medicine, ZB MED.
New!!: Boolean function and Greenpilot · See more »
Implicant
In Boolean logic, an implicant is a "covering" (sum term or product term) of one or more minterms in a sum of products (or maxterms in product of sums) of a Boolean function.
New!!: Boolean function and Implicant · See more »
Intuitionistic logic
Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof.
New!!: Boolean function and Intuitionistic logic · See more »
Iverson bracket
In mathematics, the Iverson bracket, named after Kenneth E. Iverson, is a notation that generalises the Kronecker delta.
New!!: Boolean function and Iverson bracket · See more »
Lattice gas automaton
Lattice gas automata (LGA), or lattice gas cellular automata, are a type of cellular automaton used to simulate fluid flows.
New!!: Boolean function and Lattice gas automaton · See more »
Linear separability
In Euclidean geometry, linear separability is a property of a pair of sets of points.
New!!: Boolean function and Linear separability · See more »
List of Boolean algebra topics
This is a list of topics around Boolean algebra and propositional logic.
New!!: Boolean function and List of Boolean algebra topics · See more »
List of Russian IT developers
This list of Russian IT developers includes the hardware engineers, computer scientists and programmers from the Russian Empire, the Soviet Union and the Russian Federation.
New!!: Boolean function and List of Russian IT developers · See more »
List of Russian mathematicians
This list of Russian mathematicians includes the famous mathematicians from the Russian Empire, the Soviet Union and the Russian Federation.
New!!: Boolean function and List of Russian mathematicians · See more »
List of terms relating to algorithms and data structures
The NIST Dictionary of Algorithms and Data Structures is a reference work maintained by the U.S. National Institute of Standards and Technology.
New!!: Boolean function and List of terms relating to algorithms and data structures · See more »
Logic alphabet
The logic alphabet, also called the X-stem Logic Alphabet (XLA), constitutes an iconic set of symbols that systematically represents the sixteen possible binary truth functions of logic.
New!!: Boolean function and Logic alphabet · See more »
Logic gate
In electronics, a logic gate is an idealized or physical device implementing a Boolean function; that is, it performs a logical operation on one or more binary inputs and produces a single binary output.
New!!: Boolean function and Logic gate · See more »
Logic optimization
Logic optimization, a part of logic synthesis in electronics, is the process of finding an equivalent representation of the specified logic circuit under one or more specified constraints.
New!!: Boolean function and Logic optimization · See more »
Logical conjunction
In logic, mathematics and linguistics, And (∧) is the truth-functional operator of logical conjunction; the and of a set of operands is true if and only if all of its operands are true.
New!!: Boolean function and Logical conjunction · See more »
Logical connective
In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a symbol or word used to connect two or more sentences (of either a formal or a natural language) in a grammatically valid way, such that the value of the compound sentence produced depends only on that of the original sentences and on the meaning of the connective.
New!!: Boolean function and Logical connective · See more »
Logical consequence
Logical consequence (also entailment) is a fundamental concept in logic, which describes the relationship between statements that hold true when one statement logically follows from one or more statements.
New!!: Boolean function and Logical consequence · See more »
Logical disjunction
In logic and mathematics, or is the truth-functional operator of (inclusive) disjunction, also known as alternation; the or of a set of operands is true if and only if one or more of its operands is true.
New!!: Boolean function and Logical disjunction · See more »
Logical equality
Logical equality is a logical operator that corresponds to equality in Boolean algebra and to the logical biconditional in propositional calculus.
New!!: Boolean function and Logical equality · See more »
Logical NOR
In boolean logic, logical nor or joint denial is a truth-functional operator which produces a result that is the negation of logical or.
New!!: Boolean function and Logical NOR · See more »
Lookup table
In computer science, a lookup table is an array that replaces runtime computation with a simpler array indexing operation.
New!!: Boolean function and Lookup table · See more »
Lupanov representation
Lupanov's (k, s)-representation, named after Oleg Lupanov, is a way of representing Boolean circuits so as to show that the reciprocal of the Shannon effect.
New!!: Boolean function and Lupanov representation · See more »
Material conditional
The material conditional (also known as material implication, material consequence, or simply implication, implies, or conditional) is a logical connective (or a binary operator) that is often symbolized by a forward arrow "→".
New!!: Boolean function and Material conditional · See more »
Median algebra
In mathematics, a median algebra is a set with a ternary operation \langle x,y,z \rangle satisfying a set of axioms which generalise the notion of median or majority function, as a Boolean function.
New!!: Boolean function and Median algebra · See more »
NAND gate
In digital electronics, a NAND gate (NOT-AND) is a logic gate which produces an output which is false only if all its inputs are true; thus its output is complement to that of an AND gate.
New!!: Boolean function and NAND gate · See more »
NanGate
NanGate, Inc is a privately held US/Silicon Valley-based multinational corporation dealing in Electronic Design Automation (EDA) for electrical engineering and electronics.
New!!: Boolean function and NanGate · See more »
Natural proof
In computational complexity theory, a natural proof is a certain kind of proof establishing that one complexity class differs from another one.
New!!: Boolean function and Natural proof · See more »
Oded Schramm
Oded Schramm (עודד שרם; December 10, 1961 – September 1, 2008) was an Israeli-American mathematician known for the invention of the Schramm–Loewner evolution (SLE) and for working at the intersection of conformal field theory and probability theory.
New!!: Boolean function and Oded Schramm · See more »
Outline of algebra
Algebra is one of the main branches of mathematics, covering the study of structure, relation and quantity.
New!!: Boolean function and Outline of algebra · See more »
Outline of logic
Logic is the formal science of using reason and is considered a branch of both philosophy and mathematics.
New!!: Boolean function and Outline of logic · See more »
Parasolid
Parasolid is a geometric modeling kernel originally developed by Shape Data Limited, now owned by Siemens PLM Software (formerly UGS Corp.), that can be licensed by other companies for use in their 3D computer graphics software products.
New!!: Boolean function and Parasolid · See more »
Parity function
In Boolean algebra, a parity function is a Boolean function whose value is 1 if and only if the input vector has an odd number of ones.
New!!: Boolean function and Parity function · See more »
Partitioning cryptanalysis
In cryptography, partitioning cryptanalysis is a form of cryptanalysis for block ciphers.
New!!: Boolean function and Partitioning cryptanalysis · See more »
Perceptrons (book)
Perceptrons: an introduction to computational geometry is a book written by Marvin Minsky and Seymour Papert and published in 1969.
New!!: Boolean function and Perceptrons (book) · See more »
Permutation box
In cryptography, a permutation box (or P-box) is a method of bit-shuffling used to permute or transpose bits across S-boxes inputs, retaining diffusion while transposing.
New!!: Boolean function and Permutation box · See more »
Polynomial hierarchy
In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that generalize the classes P, NP and co-NP to oracle machines.
New!!: Boolean function and Polynomial hierarchy · See more »
Post's lattice
In logic and universal algebra, Post's lattice denotes the lattice of all clones on a two-element set, ordered by inclusion.
New!!: Boolean function and Post's lattice · See more »
Probability bounds analysis
Probability bounds analysis (PBA) is a collection of methods of uncertainty propagation for making qualitative and quantitative calculations in the face of uncertainties of various kinds.
New!!: Boolean function and Probability bounds analysis · See more »
Product term
In Boolean logic, a product term is a conjunction of literals, where each literal is either a variable or its negation.
New!!: Boolean function and Product term · See more »
Property testing
In computer science, a property testing algorithm for a decision problem is an algorithm whose query complexity to its input is much smaller than the instance size of the problem.
New!!: Boolean function and Property testing · See more »
Propositional calculus
Propositional calculus is a branch of logic.
New!!: Boolean function and Propositional calculus · See more »
Propositional directed acyclic graph
A propositional directed acyclic graph (PDAG) is a data structure that is used to represent a Boolean function.
New!!: Boolean function and Propositional directed acyclic graph · See more »
Propositional variable
In mathematical logic, a propositional variable (also called a sentential variable or sentential letter) is a variable which can either be true or false.
New!!: Boolean function and Propositional variable · See more »
Pseudo-Boolean function
In mathematics and optimization, a pseudo-Boolean function is a function of the form where B.
New!!: Boolean function and Pseudo-Boolean function · See more »
Quantifier (logic)
In logic, quantification specifies the quantity of specimens in the domain of discourse that satisfy an open formula.
New!!: Boolean function and Quantifier (logic) · See more »
Quantum optimization algorithms
Mathematical optimization deals with finding the best solution to a problem (according to some criteria) from a set of possible solutions.
New!!: Boolean function and Quantum optimization algorithms · See more »
Quine–McCluskey algorithm
The Quine–McCluskey algorithm (or the method of prime implicants) is a method used for minimization of Boolean functions that was developed by Willard V. Quine and extended by Edward J. McCluskey.
New!!: Boolean function and Quine–McCluskey algorithm · See more »
Read-once function
In mathematics, a read-once function is a special type of Boolean function that can be described by a Boolean expression in which each variable appears only once.
New!!: Boolean function and Read-once function · See more »
Reed–Muller expansion
In Boolean logic, a Reed–Muller expansion (or Davio expansion) is a decomposition of a Boolean function.
New!!: Boolean function and Reed–Muller expansion · See more »
Reversible computing
Reversible computing is a model of computing where the computational process to some extent is reversible, i.e., time-invertible.
New!!: Boolean function and Reversible computing · See more »
Rvachev function
In mathematics, an R-function, or Rvachev function, is a real-valued function whose sign does not change if none of the signs of its arguments change; that is, its sign is determined solely by the signs of its arguments.
New!!: Boolean function and Rvachev function · See more »
S-box
In cryptography, an S-box (substitution-box) is a basic component of symmetric key algorithms which performs substitution.
New!!: Boolean function and S-box · See more »
Sample exclusion dimension
In computational learning theory, sample exclusion dimensions arise in the study of exact concept learning with queries.
New!!: Boolean function and Sample exclusion dimension · See more »
Schwartz–Zippel lemma
In mathematics, the Schwartz–Zippel lemma (also called the DeMillo-Lipton-Schwartz–Zippel lemma) is a tool commonly used in probabilistic polynomial identity testing, i.e. in the problem of determining whether a given multivariate polynomial is the 0-polynomial (or identically equal to 0).
New!!: Boolean function and Schwartz–Zippel lemma · See more »
SEED
SEED is a block cipher developed by the Korea Internet & Security Agency (KISA).
New!!: Boolean function and SEED · See more »
Sheffer stroke
In Boolean functions and propositional calculus, the Sheffer stroke, named after Henry M. Sheffer, written ↑, also written | (not to be confused with "||", which is often used to represent disjunction), or Dpq (in Bocheński notation), denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both".
New!!: Boolean function and Sheffer stroke · See more »
Sigil (computer programming)
In computer programming, a sigil is a symbol attached to a variable name, showing the variable's datatype or scope, usually a prefix, as in $foo, where $ is the sigil.
New!!: Boolean function and Sigil (computer programming) · See more »
Sparse distributed memory
Sparse distributed memory (SDM) is a mathematical model of human long-term memory introduced by Pentti Kanerva in 1988 while he was at NASA Ames Research Center.
New!!: Boolean function and Sparse distributed memory · See more »
Stream cipher
A stream cipher is a symmetric key cipher where plaintext digits are combined with a pseudorandom cipher digit stream (keystream).
New!!: Boolean function and Stream cipher · See more »
Symmetric Boolean function
In mathematics, a symmetric Boolean function is a Boolean function whose value does not depend on the permutation of its input bits, i.e., it depends only on the number of ones in the input.
New!!: Boolean function and Symmetric Boolean function · See more »
Symmetric difference
In mathematics, the symmetric difference, also known as the disjunctive union, of two sets is the set of elements which are in either of the sets and not in their intersection.
New!!: Boolean function and Symmetric difference · See more »
T-function
In cryptography, a T-function is a bijective mapping that updates every bit of the state in a way that can be described as x_i'.
New!!: Boolean function and T-function · See more »
Tautology (logic)
In logic, a tautology (from the Greek word ταυτολογία) is a formula or assertion that is true in every possible interpretation.
New!!: Boolean function and Tautology (logic) · See more »
Three-valued logic
In logic, a three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false and some indeterminate third value.
New!!: Boolean function and Three-valued logic · See more »
Toffoli gate
In logic circuits, the Toffoli gate (also CCNOT gate), invented by Tommaso Toffoli, is a universal reversible logic gate, which means that any reversible circuit can be constructed from Toffoli gates.
New!!: Boolean function and Toffoli gate · See more »
Truth function
In logic, a truth function is a function that accepts truth values as input and produces a truth value as output, i.e., the input and output are all truth values.
New!!: Boolean function and Truth function · See more »
Truth table
A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, boolean functions, and propositional calculus—which sets out the functional values of logical expressions on each of their functional arguments, that is, for each combination of values taken by their logical variables (Enderton, 2001).
New!!: Boolean function and Truth table · See more »
Truth-table reduction
In computability theory, a truth-table reduction is a reduction from one set of natural numbers to another.
New!!: Boolean function and Truth-table reduction · See more »
Two-element Boolean algebra
In mathematics and abstract algebra, the two-element Boolean algebra is the Boolean algebra whose underlying set (or universe or carrier) B is the Boolean domain.
New!!: Boolean function and Two-element Boolean algebra · See more »
UML state machine
UML state machine, also known as UML statechart, is a significantly enhanced realization of the mathematical concept of a finite automaton in computer science applications as expressed in the Unified Modeling Language (UML) notation.
New!!: Boolean function and UML state machine · See more »
Unate function
A unate function is a type of boolean function which has monotonic properties.
New!!: Boolean function and Unate function · See more »
Yuri Zhuravlyov (mathematician)
Yuri Ivanovich Zhuravlyov (Юрий Иванович Журавлёв; born 14 January 1935 in Voronezh) is a Russian mathematician specializing in the algebraic theory of algorithms.
New!!: Boolean function and Yuri Zhuravlyov (mathematician) · See more »
Zero-suppressed decision diagram
A zero-suppressed decision diagram (ZSDD or ZDD) is a type of binary decision diagram (BDD) based on a new reduction rule, devised by in 1993.
New!!: Boolean function and Zero-suppressed decision diagram · See more »
Zhegalkin polynomial
Zhegalkin (also Žegalkin, Gégalkine or Shegalkin) polynomials form one of many possible representations of the operations of Boolean algebra.
New!!: Boolean function and Zhegalkin polynomial · See more »
Redirects here:
A boolean function, Boolean Function, Boolean functions, Boolean valued function, Finitary boolean function, Switching Function, Switching function.
References
[1] https://en.wikipedia.org/wiki/Boolean_function
