scientific article; zbMATH DE number 822063

zbMATH Open0838.94025MaRDI QIDQ4857745FDOQ4857745

Authors: V. G. Nikonov 

Publication date: 3 June 1996

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 822064
• scientific article; zbMATH DE number 4093372
• Publication:3201048
• On the complexity of finding the number of solutions of systems of Boolean equations
• On connected Boolean functions
• An asymptotic estimate of the number of solutions of a special system of Boolean equations
• A combinatorial approach to complexity
• Boolean approaches to graph embeddings related to VLSI

zbMATH Keywords

Boolean cubethreshold functionsBoolean graphssystems of Boolean equationscovers of Boolean graphs

Mathematics Subject Classification ID

Graph theory (05C99) Boolean algebras (Boolean rings) (06E99)

Cited In (15)

• On the number of significant variables of balanced Boolean function with the fixed number of elementary conjunctions in its DNF
• О структуре решений системы из линейных псевдобулевых неравенств
• The threshold order of a Boolean function
• Title not available (Why is that?)
• The best asymptotic representation of Boolean functions by information graphs
• Threshold Boolean logic
• Title not available (Why is that?)
• A note on lattice variant of thresholdness of Boolean functions
• On the functional separability of Boolean threshold functions
• Estimating the efficiency of threshold representations of Boolean functions
• On connected Boolean functions
• Polyhedral classes of \(k\)-valued logic functions with generalized filter taboo and semitaboo
• On the structure of strictly convex \(k\)-functions
• Coverings of Boolean graphs
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857745)