The Equivalence of Sampling and Searching

Published 2013 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
The Equivalence of Sampling and Searching
Authors
Keywords
Algorithmic information theory, Extended Church-Turing Thesis, FBQP, Function problems, Kolmogorov complexity, Quantum computing, Relational problems, Sampling problems, Search problems
Journal
THEORY OF COMPUTING SYSTEMS
Volume 55, Issue 2, Pages 281-298
Publisher
Springer Nature
Online
2013-12-14
DOI
10.1007/s00224-013-9527-3
References
View 1 related references

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

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
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.