Pages that link to "Item:Q677989"
From MaRDI portal
The following pages link to Lower bounds for monotone span programs (Q677989):
Displaying 20 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- A note on monotone complexity and the rank of matrices (Q1014450) (← links)
- A characterization of span program size and improved lower bounds for monotone span programs (Q1405737) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- On arithmetic branching programs (Q1961372) (← links)
- Superpolynomial lower bounds for monotone span programs (Q1977413) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- Quadratic secret sharing and conditional disclosure of secrets (Q2129018) (← links)
- An optimal multisecret threshold scheme construction (Q2491240) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- On the number of zero-patterns of a sequence of polynomials (Q2719034) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- Threshold Secret Sharing Requires a Linear Size Alphabet (Q3181037) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- Strongly exponential lower bounds for monotone computation (Q4978063) (← links)
- Lower bounds for monotonic list labeling (Q5056101) (← links)
- Threshold secret sharing requires a linear-size alphabet (Q5140836) (← links)
- Security in Communication Networks (Q5491703) (← links)
