✕
Skip to main content
Springer Nature Link
Log in
Menu
Find a journal Publish with us Track your research
Search
Saved research
Cart
  1. Home
  2. computational complexity
  3. Article

Special Issue On Worst-case Versus Average-case Complexity Editors’ Foreword

  • Open access
  • Published: 05 December 2007
  • Volume 16, pages 325–330 (2007)
  • Cite this article

You have full access to this open access article

Download PDF
Save article
View saved research
Image computational complexity Aims and scope Submit manuscript
Special Issue On Worst-case Versus Average-case Complexity Editors’ Foreword
Download PDF
  • Oded Goldreich1 &
  • Salil Vadhan2 
  • 841 Accesses

  • 2 Citations

  • 3 Altmetric

  • Explore all metrics

Article PDF

Download to read the full article text

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.
  • Computational Complexity and Algorithmic Techniques

Author information

Authors and Affiliations

  1. Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel

    Oded Goldreich

  2. School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, 02138, USA

    Salil Vadhan

Authors
  1. Oded Goldreich
    View author publications

    Search author on:PubMed Google Scholar

  2. Salil Vadhan
    View author publications

    Search author on:PubMed Google Scholar

Corresponding author

Correspondence to Oded Goldreich.

Rights and permissions

Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

Reprints and permissions

About this article

Cite this article

Goldreich, O., Vadhan, S. Special Issue On Worst-case Versus Average-case Complexity Editors’ Foreword. comput. complex. 16, 325–330 (2007). https://doi.org/10.1007/s00037-007-0232-y

Download citation

  • Published: 05 December 2007

  • Issue date: December 2007

  • DOI: https://doi.org/10.1007/s00037-007-0232-y

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Pseudorandom Generator
  • Complexity Assumption
  • Electronic Colloquium
  • Short Vector Problem
  • Cover Radius Problem

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us
  • Track your research

Footer Navigation

Discover content

  • Journals A-Z
  • Books A-Z
  • Subjects A-Z

Publish with us

  • Journal finder
  • Publish your research
  • Language editing
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our brands

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Discover

Corporate Navigation

  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support
  • Legal notice
  • Cancel contracts here

104.23.197.38

Not affiliated

Springer Nature

© 2026 Springer Nature