Pages that link to "Item:Q1405737"
From MaRDI portal
The following pages link to A characterization of span program size and improved lower bounds for monotone span programs (Q1405737):
Displaying 16 items.
- On the readability of monotone Boolean formulae (Q652622) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- A note on monotone complexity and the rank of matrices (Q1014450) (← links)
- Superpolynomial lower bounds for monotone span programs (Q1977413) (← links)
- Quadratic secret sharing and conditional disclosure of secrets (Q2129018) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← 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)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- Threshold secret sharing requires a linear-size alphabet (Q5140836) (← links)
- Monotone circuit lower bounds from resolution (Q5140848) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- On the Readability of Monotone Boolean Formulae (Q5323097) (← links)