- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1420-8954
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Special Issue On Worst-case Versus Average-case Complexity Editors’ Foreword ; volume:16 ; number:4 ; day:5 ; month:12 ; year:2007 ; pages:325-330 ; date:12.2007
Computational complexity ; 16, Heft 4 (5.12.2007), 325-330, 12.2007
- Creator
-
Goldreich, Oded
Vadhan, Salil
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00037-007-0232-y
- URN
-
urn:nbn:de:101:1-2021081822010940232209
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.08.2025, 10:46 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Goldreich, Oded
- Vadhan, Salil
- SpringerLink (Online service)
Other Objects (12)
Average-case intractability vs. worst-case intractability
Editors' Foreword
Foreword guest editors
Guest Editors’ Foreword
Guest Editors' Foreword
Guest Editors’ Foreword
From worst-case to average-case efficiency : approximating combinatorial optimization problems
Foreword of the Editors
Worst case
Worst Cases
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Average-case intractability vs. worst-case intractability
Editors' Foreword
Foreword guest editors
Guest Editors’ Foreword
Guest Editors' Foreword
Guest Editors’ Foreword
From worst-case to average-case efficiency : approximating combinatorial optimization problems
Foreword of the Editors
Worst case
Worst Cases
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Average-case intractability vs. worst-case intractability
Editors' Foreword
Foreword guest editors
Guest Editors’ Foreword
Guest Editors' Foreword
Guest Editors’ Foreword
From worst-case to average-case efficiency : approximating combinatorial optimization problems
Foreword of the Editors
Worst case
Worst Cases
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms