On connected Boolean functions (Q1961460): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5769706 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial-time inference of all valid implications for Horn and related formulae / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the geometric separability of Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Way to Simplify Truth Functions / rank | |||
Normal rank | |||
Latest revision as of 12:13, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On connected Boolean functions |
scientific article |
Statements
On connected Boolean functions (English)
0 references
14 February 2000
0 references
Various classes of Boolean functions are introduced: connected, strongly connected, geodetic, convex, strongly convex and concordant. They are characterized by some properties of the subgraph of the Boolean hypercube induced by the (false) true points of a function. The relationships between these properties and the DNF representation of a Boolean function as well as the inclusions between these classes are studied.
0 references
computational complexity
0 references
Boolean function
0 references
monotone
0 references
unate
0 references
geodetic
0 references
subgraph of the Boolean hypercube
0 references
DNF representation
0 references
