Pages that link to "Item:Q4170638"

The following pages link to Polymatroidal dependence structure of a set of random variables (Q4170638):

Displaying 33 items.

• Mean mutual information and symmetry breaking for finite random fields (Q424692) (← links)
• Linear threshold multisecret sharing schemes (Q456082) (← links)
• On a connection between information and group lattices (Q657554) (← links)
• Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
• Canonical decompositions of symmetric submodular systems (Q760444) (← links)
• On the optimization of bipartite secret sharing schemes (Q766238) (← links)
• Submodular function minimization (Q995782) (← links)
• Matroids on partially ordered sets (Q1271880) (← links)
• Matroid representations by partitions (Q1301662) (← links)
• Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
• On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
• Classes of matroids closed under minors and principal extensions (Q1786053) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
• Secret sharing and duality (Q2033511) (← links)
• On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
• Attribute based diversification of seeds for targeted influence maximization (Q2055595) (← links)
• Submodular functions and rooted trees (Q2095463) (← links)
• Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← links)
• Extending Brickell-Davenport theorem to non-perfect secret sharing schemes (Q2256110) (← links)
• Minimizing ratio of monotone non-submodular functions (Q2326079) (← links)
• Adhesivity of polymatroids (Q2455572) (← links)
• Representability of matroids by \(c\)-arrangements is undecidable (Q2696633) (← links)
• Entropy and set cardinality inequalities for partition-determined functions (Q2904591) (← links)
• Information Theoretic Security for Encryption Based on Conditional Rényi Entropies (Q2948257) (← links)
• On secret sharing schemes, matroids and polymatroids (Q3056338) (← links)
• Recent Advances in Non-perfect Secret Sharing Schemes (Q3188243) (← links)
• Conditional Independences among Four Random Variables I (Q4862747) (← links)
• Finding a Stable Allocation in Polymatroid Intersection (Q5108257) (← links)
• Multi-variate correlation and mixtures of product measures (Q5122261) (← links)
• One-adhesive polymatroids (Q5858540) (← links)
• Algebraic matroids are almost entropic (Q6083329) (← links)
• No Eleventh Conditional Ingleton Inequality (Q6657568) (← links)