Corpus ID: 16890351

Rank and fooling set size

@article{Hamed2013RankAF,
  title={Rank and fooling set size},
  author={Aya Hamed and Troy Lee},
  journal={ArXiv},
  year={2013},
  volume={abs/1310.7321}
}
  • Aya Hamed, Troy Lee
  • Published 2013
  • Computer Science, Mathematics
  • ArXiv
  • Say that A is a Hadamard factorization of the identity I_n of size n if the entrywise product of A and the transpose of A is I_n. It can be easily seen that the rank of any Hadamard factorization of the identity must be at least sqrt{n}. Dietzfelbinger et al. raised the question if this bound can be achieved, and showed a boolean Hadamard factorization of the identity of rank n^{0.792}. More recently, Klauck and Wolf gave a construction of Hadamard factorizations of the identity of rank n^{0… CONTINUE READING

    Topics from this paper.

    Ordered biclique partitions and communication complexity problems
    10
    Some notes on two lower bound methods for communication complexity
    • F. Duris
    • Computer Science, Mathematics
    • 2017

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 11 REFERENCES
    Fooling-sets and rank
    10
    Fooling One-Sided Quantum Protocols
    10
    Communication Complexity
    591
    Concrete Mathematics
    • 1994
    Fooling one - sidedquantum protocols
    • 1997
    Fooling onesidedquantum protocols
      Fooling sets (a ka cross-free matchings) and rank in nonzero characteristic
      • 1996