- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Theoretical Computer Science, Band 137, Ausgabe 2, Seite 279-282, 1995
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Humboldt-Universität zu Berlin
- (when)
-
1995
- Creator
- DOI
-
10.18452/9151
- URN
-
urn:nbn:de:kobv:11-10054721
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:50 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
- Arvind, Vikraman
- Köbler, Johannes
- Schöning, Uwe
- Schuler, Rainer
- Humboldt-Universität zu Berlin
Time of origin
- 1995
Other Objects (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.