Improving Exhaustive Search Implies Superpolynomial Lower Bounds

Published 2013 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
Authors
Keywords
-
Journal
SIAM JOURNAL ON COMPUTING
Volume 42, Issue 3, Pages 1218-1244
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Online
2013-06-26
DOI
10.1137/10080703x

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now
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.