Upper Bounds on the Boolean Rank of Kronecker Products.
Ishay HavivMichal ParnasPublished in: LAGOS (2021)
Keyphrases
- upper bound
- lower bound
- worst case
- upper and lower bounds
- lower and upper bounds
- tight bounds
- kronecker product
- real valued
- efficiently computable
- upper bounding
- branch and bound algorithm
- sample size
- concept classes
- highly ranked
- error probability
- permutation flowshop
- special case
- branch and bound
- product information
- linear functions
- social networks
- sample complexity
- boolean functions
- linear program