Sign in

Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test.

Farid M. AblayevAndris AmbainisKamil KhadievAliya Khadieva
Published in: SOFSEM (2018)
Keyphrases
  • communication protocols
  • lower bound
  • ordered binary decision diagrams
  • upper bound
  • branch and bound algorithm
  • branch and bound
  • communication protocol
  • objective function
  • special case
  • end to end
  • computer networks