Recommendations
- Superpolynomial lower bounds for monotone span programs
- Security in Communication Networks
- A characterization of span program size and improved lower bounds for monotone span programs
- scientific article; zbMATH DE number 1775428
- Construction of a monotone span program with multiplication
- scientific article; zbMATH DE number 1256780
- An efficient construction of dual monotone span programs
- Separating the Power of Monotone Span Programs over Different Fields
- Lower bounds for local monotonicity reconstruction from transitive-closure spanners
- Lower bounds for local monotonicity reconstruction from transitive-closure spanners
Cites work
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 4008289 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 1256780 (Why is no real title available?)
- scientific article; zbMATH DE number 1306900 (Why is no real title available?)
- scientific article; zbMATH DE number 1024000 (Why is no real title available?)
- scientific article; zbMATH DE number 1088899 (Why is no real title available?)
- scientific article; zbMATH DE number 1088900 (Why is no real title available?)
- scientific article; zbMATH DE number 1101416 (Why is no real title available?)
- scientific article; zbMATH DE number 812038 (Why is no real title available?)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- An explication of secret sharing schemes
- Geometric secret sharing schemes and their duals
- How to share a secret
- Lower bounds for monotone span programs
- On another Boolean matrix
- On computing the determinant in small parallel time using a small number of processors
- On secret sharing systems
- On the classification of ideal secret sharing schemes
- On the information rate of perfect secret sharing schemes
- On the information rate of secret sharing schemes
- On the size of shares for secret sharing schemes
- Structure and importance of logspace-MOD class
- The monotone circuit complexity of Boolean functions
- Universally ideal secret-sharing schemes
Cited in
(23)- Security in Communication Networks
- Separating the Power of Monotone Span Programs over Different Fields
- Strongly exponential lower bounds for monotone computation
- scientific article; zbMATH DE number 1775428 (Why is no real title available?)
- Secret sharing schemes for dense forbidden graphs
- Superpolynomial lower bounds for monotone span programs
- Optimal linear secret sharing schemes for graph access structures on six participants
- On abelian and homomorphic secret sharing schemes
- An optimal multisecret threshold scheme construction
- On arithmetic branching programs
- Lower bounds for monotone span programs
- Improving the linear programming technique in the search for lower bounds in secret sharing
- On the number of zero-patterns of a sequence of polynomials
- Quadratic secret sharing and conditional disclosure of secrets
- Threshold secret sharing requires a linear-size alphabet
- On Linear Secret Sharing for Connectivity in Directed Graphs
- Construction of a monotone span program with multiplication
- Lower bounds for monotonic list labeling
- Secret-Sharing Schemes: A Survey
- Secret-sharing schemes for very dense graphs
- A note on monotone complexity and the rank of matrices
- A characterization of span program size and improved lower bounds for monotone span programs
- Threshold Secret Sharing Requires a Linear Size Alphabet
This page was built for publication: Lower bounds for monotone span programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677989)
