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