Lower bounds for monotone span programs
From MaRDI portal
Publication:677989
DOI10.1007/BF01202040zbMATH Open0870.68072OpenAlexW2169672310MaRDI QIDQ677989FDOQ677989
Mike Paterson, Anna Gál, Amos Beimel
Publication date: 7 September 1997
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01202040
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
- How to share a secret
- Title not available (Why is that?)
- On another Boolean matrix
- On the classification of ideal secret sharing schemes
- On computing the determinant in small parallel time using a small number of processors
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- On the information rate of perfect secret sharing schemes
- On secret sharing systems
- The monotone circuit complexity of Boolean functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Universally ideal secret-sharing schemes
- Title not available (Why is that?)
- On the information rate of secret sharing schemes
- Lower bounds for monotone span programs
- Title not available (Why is that?)
- Structure and importance of logspace-MOD class
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Geometric secret sharing schemes and their duals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (21)
- Lower bounds for monotonic list labeling
- Title not available (Why is that?)
- Threshold Secret Sharing Requires a Linear Size Alphabet
- On the number of zero-patterns of a sequence of polynomials
- On Linear Secret Sharing for Connectivity in Directed Graphs
- Title not available (Why is that?)
- Quadratic secret sharing and conditional disclosure of secrets
- Secret-sharing schemes for very dense graphs
- Lower bounds for monotone span programs
- Improving the linear programming technique in the search for lower bounds in secret sharing
- A note on monotone complexity and the rank of matrices
- On abelian and homomorphic secret sharing schemes
- Superpolynomial lower bounds for monotone span programs
- Secret Sharing Schemes for Dense Forbidden Graphs
- Optimal linear secret sharing schemes for graph access structures on six participants
- On arithmetic branching programs
- Secret-Sharing Schemes: A Survey
- Separating the Power of Monotone Span Programs over Different Fields
- Security in Communication Networks
- An optimal multisecret threshold scheme construction
- A characterization of span program size and improved lower bounds for monotone span programs
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)
