pith. sign in

U of Amsterdam)

Identifiers

  • name variant U of Amsterdam) 0.60 · backfill

Papers (13)

  1. A Survey of Quantum Learning Theory quant-ph · 2017 · author #3
  2. Optimal Quantum Sample Complexity of Learning Algorithms quant-ph · 2016 · author #3
  3. Optimal quantum query bounds for almost all Boolean functions quant-ph · 2012 · author #5
  4. How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? quant-ph · 2012 · author #3
  5. Non-locality and Communication Complexity quant-ph · 2009 · author #2
  6. Quantum Verification of Matrix Products quant-ph · 2004 · author #3
  7. Robust Polynomials and Quantum Algorithms quant-ph · 2003 · author #2
  8. Communication Complexity Lower Bounds by Polynomials cs.CC · 1999 · author #4
  9. Average-Case Quantum Query Complexity quant-ph · 1999 · author #3
  10. Average-Case Complexity of Shellsort cs.DS · 1999 · author #4
  11. New Applications of the Incompressibility Method: Part I cs.CC · 1998 · author #4
  12. New Applications of the Incompressibility Method: Part II cs.CC · 1998 · author #5
  13. Quantum Lower Bounds by Polynomials quant-ph · 1998 · author #6

Mentions

  • 1208.1122 #5 · backfill · confidence 0.70 U of Amsterdam)
  • 1206.0717 #3 · backfill · confidence 0.70 U of Amsterdam)
  • 0907.3584 #2 · backfill · confidence 0.70 U of Amsterdam)

Frequent Coauthors