scientific article; zbMATH DE number 3545568
From MaRDI portal
Publication:4120519
zbMath0349.94046MaRDI QIDQ4120519
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (36)
Testing read-once functions in a median-augmented element basis ⋮ Efficient parallel recognition algorithms of cographs and distance hereditary graphs ⋮ A global parallel algorithm for the hypergraph transversal problem ⋮ Factoring Boolean functions using graph partitioning ⋮ The read once formula of a series-parallel network ⋮ Knowledge compilation meets database theory: compiling queries to decision diagrams ⋮ On the Readability of Monotone Boolean Formulae ⋮ Edge-coloured complete graphs: Connectedness of some subgraphs ⋮ Using relevance queries for identification of read-once functions ⋮ On CIS circulants ⋮ Some test length bounds for nonrepeating functions in the \(\{ \& , \vee \}\) basis ⋮ On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems ⋮ Minimum self-dual decompositions of positive dual-minor Boolean functions ⋮ On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions ⋮ Computing square roots of trivially perfect and threshold graphs ⋮ On the readability of monotone Boolean formulae ⋮ An improvement on the complexity of factoring read-once Boolean functions ⋮ On read-once functions over \(\mathbb{Z}_3\) ⋮ Combinatorial characterization of read-once formulae ⋮ Testing read-once functions over the elementary basis ⋮ Iterated Boolean functions in the elementary basis ⋮ Learning read once functions using subcube parity queries ⋮ Acyclic, or totally tight, two-person game forms: characterization and main properties ⋮ Not complementary connected and not CIS \(d\)-graphs form weakly monotone families ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ On effectivity functions of game forms ⋮ Recognizing read-once functions from depth-three formulas ⋮ Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games ⋮ Dominating sequences in graphs ⋮ Characterizations of cographs as intersection graphs of paths on a grid ⋮ Double Horn functions ⋮ Characterizing Arithmetic Read-Once Formulae ⋮ Vertex- and edge-minimal and locally minimal graphs ⋮ Functions that are read-once on a subset of their inputs ⋮ Read-Once Functions Revisited and the Readability Number of a Boolean Function ⋮ Theory revision with queries: Horn, read-once, and parity formulas
This page was built for publication:
