If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1420-8954
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances ; volume:16 ; number:4 ; day:5 ; month:12 ; year:2007 ; pages:412-441 ; date:12.2007
Computational complexity ; 16, Heft 4 (5.12.2007), 412-441, 12.2007
- Urheber
-
Gutfreund, Dan
Shaltiel, Ronen
Ta-Shma, Amnon
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00037-007-0235-8
- URN
-
urn:nbn:de:101:1-2021081922021304362947
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:01 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Gutfreund, Dan
- Shaltiel, Ronen
- Ta-Shma, Amnon
- SpringerLink (Online service)
Ähnliche Objekte (12)
Sparse instances of hard problems
Automating Resolution is NP-Hard
Properties of worst-case GMRES
Challenges in implementing worst-case analysis
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Computing the Interleaving Distance is NP-Hard
Robust Geometric Programming is co-NP hard
Hard to solve instances of the Euclidean Traveling Salesman Problem
Revisiting Worst-case DEA for Composite Indicators
Average-case intractability vs. worst-case intractability
The worst-case GMRES for normal matrices
Sparse instances of hard problems
Automating Resolution is NP-Hard
Properties of worst-case GMRES
Challenges in implementing worst-case analysis
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Computing the Interleaving Distance is NP-Hard
Robust Geometric Programming is co-NP hard
Hard to solve instances of the Euclidean Traveling Salesman Problem
Revisiting Worst-case DEA for Composite Indicators
Average-case intractability vs. worst-case intractability
The worst-case GMRES for normal matrices
Sparse instances of hard problems
Automating Resolution is NP-Hard
Properties of worst-case GMRES
Challenges in implementing worst-case analysis
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Computing the Interleaving Distance is NP-Hard
Robust Geometric Programming is co-NP hard
Hard to solve instances of the Euclidean Traveling Salesman Problem
Revisiting Worst-case DEA for Composite Indicators
Average-case intractability vs. worst-case intractability