• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness.

Rahul JainJaikumar RadhakrishnanPranab Sen
Published in: FOCS (2003)
Keyphrases
  • lower bound
  • upper bound
  • small number
  • lower and upper bounds
  • computational cost
  • neural network
  • data sets
  • decision problems
  • finite number