- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Theoretical Computer Science, Band 137, Ausgabe 2, Seite 279-282, 1995
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Humboldt-Universität zu Berlin
- (wann)
-
1995
- Urheber
- DOI
-
10.18452/9151
- URN
-
urn:nbn:de:kobv:11-10054721
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:50 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
- Arvind, Vikraman
- Köbler, Johannes
- Schöning, Uwe
- Schuler, Rainer
- Humboldt-Universität zu Berlin
Entstanden
- 1995
Ähnliche Objekte (12)
If-then planning
If no Higgs then what?
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
A polynomial algorithm for a NP-hard to solve optimization problem
Individual differences in if-then planning : Insights from the development and application of the If-Then Planning Scale (ITPS)
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
If Skill is Normative, Then Norms are Everywhere
Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
N.P.
NP
N.P.
If an orbit closure is big enough then it's trivial.
If-then planning
If no Higgs then what?
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
A polynomial algorithm for a NP-hard to solve optimization problem
Individual differences in if-then planning : Insights from the development and application of the If-Then Planning Scale (ITPS)
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
If Skill is Normative, Then Norms are Everywhere
Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
N.P.
NP
N.P.
If an orbit closure is big enough then it's trivial.
If-then planning
If no Higgs then what?
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
A polynomial algorithm for a NP-hard to solve optimization problem
Individual differences in if-then planning : Insights from the development and application of the If-Then Planning Scale (ITPS)
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
If Skill is Normative, Then Norms are Everywhere
Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
N.P.
NP
N.P.