Pages that link to "Item:Q1121854"
From MaRDI portal
The following pages link to Functions computed by monotone Boolean formulas with no repeated variables (Q1121854):
Displaying 14 items.
- On a class of Boolean functions with matroid property (Q793741) (← links)
- Replaceability and computational equivalence for monotone boolean functions (Q798296) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- On the planar monotone computation of Boolean functions (Q1099134) (← links)
- Solution of Rota's problem on the order of series-parallel networks (Q1190152) (← links)
- Double Horn functions (Q1271644) (← links)
- Generating Boolean \(\mu\)-expressions (Q1892713) (← links)
- Minimum self-dual decompositions of positive dual-minor Boolean functions (Q1961458) (← links)
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461) (← links)
- On lengths of edge-labeled graph expressions (Q2161278) (← links)
- Monotone Boolean functions capture their primes (Q2253712) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs (Q2357161) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)