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