Pages that link to "Item:Q685684"
From MaRDI portal
The following pages link to Combinatorial characterization of read-once formulae (Q685684):
Displayed 24 items.
- Using relevance queries for identification of read-once functions (Q376140) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems (Q628313) (← links)
- Competitive evaluation of threshold functions in the priced information model (Q646704) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Acyclic, or totally tight, two-person game forms: characterization and main properties (Q966009) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- A note on monotone complexity and the rank of matrices (Q1014450) (← links)
- Double Horn functions (Q1271644) (← links)
- Functions that are read-once on a subset of their inputs (Q1308741) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- The read once formula of a series-parallel network (Q2166241) (← links)
- On effectivity functions of game forms (Q2268107) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games (Q2515585) (← links)
- Characterizing Arithmetic Read-Once Formulae (Q2828215) (← links)
- Read-Once Functions Revisited and the Readability Number of a Boolean Function (Q3439365) (← links)
- (Q5002654) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)