- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
163 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Aachen, Techn. Hochsch., Diss., 2013 (Nicht für den Austausch)
- Schlagwort
-
Komplexität, Gerichteter Graph, Baumweite, Spiel in extensiver Form
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:47 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.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
Graph complexity measures and monotonicity
Complexity measures for public-key cryptosystems
Complexity measures for public-key cryptosystems
Quantum complexity of graph and algebraic problems
Computational complexity of graph polynomials
Software complexity : measures and methods
Models of discrete-time stochastic processes and associated complexity measures
Investigating measures of complexity for dynamical systems and for time systems
Gibbs measures and spin models on trees and random graphs
Algorithmic graph minor theory : approximation, parameterized complexity, and practical aspects
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers
Exact algorithms based on specific complexity measures for hard problems
Graph complexity measures and monotonicity
Complexity measures for public-key cryptosystems
Complexity measures for public-key cryptosystems
Quantum complexity of graph and algebraic problems
Computational complexity of graph polynomials
Software complexity : measures and methods
Models of discrete-time stochastic processes and associated complexity measures
Investigating measures of complexity for dynamical systems and for time systems
Gibbs measures and spin models on trees and random graphs
Algorithmic graph minor theory : approximation, parameterized complexity, and practical aspects
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers
Exact algorithms based on specific complexity measures for hard problems
Graph complexity measures and monotonicity
Complexity measures for public-key cryptosystems
Complexity measures for public-key cryptosystems
Quantum complexity of graph and algebraic problems
Computational complexity of graph polynomials
Software complexity : measures and methods
Models of discrete-time stochastic processes and associated complexity measures
Investigating measures of complexity for dynamical systems and for time systems
Gibbs measures and spin models on trees and random graphs
Algorithmic graph minor theory : approximation, parameterized complexity, and practical aspects
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers