Searching for "On the Size of Monotone Span Programs." – sorted by Relevance.
-
On the size of Monotone Span Programs
- On the Size of Monotone Span Programs Ventzislav Nikov 1 , Svetla Nikova 2 ⋆ , and Bart Preneel 2
- Cited by 1 (1 self) – Add To MetaCart
-
Lower Bounds for Monotone Span Programs
- for the size of monotone span programs, improving on the largest previously known bounds for explicit functions
- Cited by 32 (5 self) – Add To MetaCart
-
A Note on Monotone Complexity and the Rank of Matrices
- associated with these structures gives lower bounds on monotone span program size and monotone formula size
- Add To MetaCart
-
On the Power of Nonlinear Secret-Sharing
- class of linear schemes, whose complexity coincides with the monotone span program size of their access
- Cited by 4 (3 self) – Add To MetaCart
-
On the Power of Nonlinear Secret-Sharing
- to a class of linear schemes, whose complexity coincides with the monotone span program size
- Add To MetaCart
-
Monotone Complexity and the Rank of Matrices
- . In particular it has been used for the size of monotone formulas and monotone span programs. In most cases
- Cited by 2 (0 self) – Add To MetaCart
-
Combinatorial Methods In Boolean Function Complexity
- , for example for formula size. Monotone span programs have only positive literals (non-negated variables
- Cited by 9 (1 self) – Add To MetaCart
-
On span programs
- tight bounds for the size of monotone span programs for threshold functions, and discovered
- Cited by 99 (3 self) – Add To MetaCart
-
Span Programs and General Secure Multi-Party Computation
- , the complexity of our protocols is directly related to the size of a monotone span program [16] that rejects all
- Cited by 5 (3 self) – Add To MetaCart
-
Linear multi-secret sharing schemes
- by �M(M, ρ) = � M, and call it monotone span program or labelled matrix. The row size of monotone span
- Add To MetaCart

