- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Reihe CI ; 235-07
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Dortmund
- (wer)
-
Universitätsbibliothek Dortmund
- (wann)
-
2007
- Urheber
-
Beume, Nicola
Fonseca, Carlos M.
López-Ibáñez, Manuel
Paquete, Luís
Vahrenhold, Jan
- Beteiligte Personen und Organisationen
- Handle
-
2003/26142
- URN
-
urn:nbn:de:101:1-201606131042
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:56 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
- Beume, Nicola
- Fonseca, Carlos M.
- López-Ibáñez, Manuel
- Paquete, Luís
- Vahrenhold, Jan
- Sonderforschungsbereich Design und Management Komplexer Technischer Prozesse und Systeme mit Methoden der Computational Intelligence
- Universitätsbibliothek Dortmund
Entstanden
- 2007
Ähnliche Objekte (12)
The complexity of computing the MCD-estimator
The Complexity of Computing the MCD-Estimator
Efficient MIP techniques for computing the relaxation complexity
On the Complexity of Computing MP Distance Between Binary Phylogenetic Trees
Soft Computing: Coping with Complexity
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
On the complexity of counting irreducible components and computing Betti numbers of algebraic varieties
On the complexity of counting irreducible components and computing Betti numbers of algebraic varieties
Tackling Complexity in High Performance Computing Applications
On the solvability of urban complexity
On the Political Economy of Complexity
On the Complexity of Modified Instances
The complexity of computing the MCD-estimator
The Complexity of Computing the MCD-Estimator
Efficient MIP techniques for computing the relaxation complexity
On the Complexity of Computing MP Distance Between Binary Phylogenetic Trees
Soft Computing: Coping with Complexity
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
On the complexity of counting irreducible components and computing Betti numbers of algebraic varieties
On the complexity of counting irreducible components and computing Betti numbers of algebraic varieties
Tackling Complexity in High Performance Computing Applications
On the solvability of urban complexity
On the Political Economy of Complexity
On the Complexity of Modified Instances
The complexity of computing the MCD-estimator
The Complexity of Computing the MCD-Estimator
Efficient MIP techniques for computing the relaxation complexity
On the Complexity of Computing MP Distance Between Binary Phylogenetic Trees
Soft Computing: Coping with Complexity
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
On the complexity of counting irreducible components and computing Betti numbers of algebraic varieties
On the complexity of counting irreducible components and computing Betti numbers of algebraic varieties
Tackling Complexity in High Performance Computing Applications
On the solvability of urban complexity
On the Political Economy of Complexity