Faster access than browser!
22 relations: Boolean expression, Boolean function, Clique (graph theory), Cograph, Conjunctive normal form, De Morgan's laws, Discrete Applied Mathematics, Discrete Mathematics (journal), Disjunctive normal form, Interpretation (logic), Journal of the ACM, Logical conjunction, Logical disjunction, Lowest common ancestor, Median algebra, Monotonic function, Negation, Russian Mathematical Surveys, Theoretical Computer Science (journal), Time complexity, Triangle graph, Variable (mathematics).
Boolean expression
In computer science, a Boolean expression is an expression in a programming language that produces a Boolean value when evaluated, i.e. one of true or false.
New!!: Read-once function and Boolean expression · See more »
Boolean function
In mathematics and logic, a (finitary) Boolean function (or switching function) is a function of the form ƒ: Bk → B, where B.
New!!: Read-once function and Boolean function · See more »
Clique (graph theory)
In the mathematical area of graph theory, a clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent; that is, its induced subgraph is complete.
New!!: Read-once function and Clique (graph theory) · See more »
Cograph
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union.
New!!: Read-once function and Cograph · See more »
Conjunctive normal form
In Boolean logic, a formula is in conjunctive normal form (CNF) or clausal normal form if it is a conjunction of one or more clauses, where a clause is a disjunction of literals; otherwise put, it is an AND of ORs.
New!!: Read-once function and Conjunctive normal form · See more »
De Morgan's laws
In propositional logic and boolean algebra, De Morgan's laws are a pair of transformation rules that are both valid rules of inference.
New!!: Read-once function and De Morgan's laws · See more »
Discrete Applied Mathematics
Discrete Applied Mathematics is a peer-reviewed academic journal in mathematics, published by Elsevier.
New!!: Read-once function and Discrete Applied Mathematics · See more »
Discrete Mathematics (journal)
Discrete Mathematics is a biweekly peer-reviewed scientific journal in the broad area of discrete mathematics, combinatorics, graph theory, and their applications.
New!!: Read-once function and Discrete Mathematics (journal) · 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!!: Read-once function and Disjunctive normal form · See more »
Interpretation (logic)
An interpretation is an assignment of meaning to the symbols of a formal language.
New!!: Read-once function and Interpretation (logic) · See more »
Journal of the ACM
The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects.
New!!: Read-once function and Journal of the ACM · 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!!: Read-once function and Logical conjunction · 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!!: Read-once function and Logical disjunction · See more »
Lowest common ancestor
In graph theory and computer science, the lowest common ancestor (LCA) of two nodes and in a tree or directed acyclic graph (DAG) is the lowest (i.e. deepest) node that has both and as descendants, where we define each node to be a descendant of itself (so if has a direct connection from, is the lowest common ancestor).
New!!: Read-once function and Lowest common ancestor · 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!!: Read-once function and Median algebra · See more »
Monotonic function
In mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order.
New!!: Read-once function and Monotonic function · See more »
Negation
In logic, negation, also called the logical complement, is an operation that takes a proposition P to another proposition "not P", written \neg P (¬P), which is interpreted intuitively as being true when P is false, and false when P is true.
New!!: Read-once function and Negation · See more »
Russian Mathematical Surveys
Uspekhi Matematicheskikh Nauk (Успехи математических наук) is a Russian mathematical journal, published by the Russian Academy of Sciences and Moscow Mathematical Society and translated into English as Russian Mathematical Surveys.
New!!: Read-once function and Russian Mathematical Surveys · See more »
Theoretical Computer Science (journal)
Theoretical Computer Science (TCS) is a computer science journal published by Elsevier, started in 1975 and covering theoretical computer science.
New!!: Read-once function and Theoretical Computer Science (journal) · See more »
Time complexity
In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.
New!!: Read-once function and Time complexity · See more »
Triangle graph
In the mathematical field of graph theory, the triangle graph is a planar undirected graph with 3 vertices and 3 edges, in the form of a triangle.
New!!: Read-once function and Triangle graph · See more »
Variable (mathematics)
In elementary mathematics, a variable is a symbol, commonly an alphabetic character, that represents a number, called the value of the variable, which is either arbitrary, not fully specified, or unknown.
New!!: Read-once function and Variable (mathematics) · See more »
References
[1] https://en.wikipedia.org/wiki/Read-once_function
