Pages that link to "Item:Q1301662"
From MaRDI portal
The following pages link to Matroid representations by partitions (Q1301662):
Displaying 21 items.
- Secret-sharing matroids need not be algebraic (Q284751) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- Classes of matroids closed under minors and principal extensions (Q1786053) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- On ideal homomorphic secret sharing schemes and their decomposition (Q1981791) (← 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)
- On an infinite family of graphs with information ratio \(2 - 1/k\) (Q2390949) (← links)
- Representability of matroids by \(c\)-arrangements is undecidable (Q2696633) (← links)
- Ideal hierarchical secret sharing and lattice path matroids (Q2697480) (← links)
- The free product of M-fuzzifying matroids1 (Q2988582) (← links)
- Ideal Secret Sharing Schemes for Useful Multipartite Access Structures (Q3005583) (← links)
- On secret sharing schemes, matroids and polymatroids (Q3056338) (← links)
- Ideal Hierarchical Secret Sharing Schemes (Q3408196) (← links)
- Secret sharing schemes for ports of matroids of rank 3 (Q5858541) (← links)
- A note on representing dowling geometries by partitions (Q5858543) (← links)
- Algebraic matroids are almost entropic (Q6083329) (← links)
- On ideal and weakly-ideal access structures (Q6112264) (← links)
