Pages that link to "Item:Q1977413"
From MaRDI portal
The following pages link to Superpolynomial lower bounds for monotone span programs (Q1977413):
Displaying 31 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- Random constructions and density results (Q1009013) (← links)
- A note on monotone complexity and the rank of matrices (Q1014450) (← links)
- On reducibility and symmetry of disjoint NP pairs. (Q1401249) (← links)
- A characterization of span program size and improved lower bounds for monotone span programs (Q1405737) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- Existence results for cyclotomic orthomorphisms (Q2014248) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- On pseudorandom subsets in finite fields. I: Measure of pseudorandomness and support of Boolean functions (Q2052786) (← links)
- Quadratic secret sharing and conditional disclosure of secrets (Q2129018) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- On the number of zero-patterns of a sequence of polynomials (Q2719034) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- Span-program-based quantum algorithm for evaluating formulas (Q2913813) (← 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)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- Threshold secret sharing requires a linear-size alphabet (Q5140836) (← links)
- On the complexity of computing a random Boolean function over the reals (Q5140843) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- Security in Communication Networks (Q5491703) (← links)
- Secret sharing schemes for ports of matroids of rank 3 (Q5858541) (← links)
- Improved polynomial secret-sharing schemes (Q6582181) (← links)
- The automorphism group of projective norm graphs (Q6631553) (← links)
