An improved lower bound on query complexity for quantum PAC learning

Published 2010 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
An improved lower bound on query complexity for quantum PAC learning
Authors
Keywords
-
Journal
INFORMATION PROCESSING LETTERS
Volume 111, Issue 1, Pages 40-45
Publisher
Elsevier BV
Online
2010-10-13
DOI
10.1016/j.ipl.2010.10.007

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.