Monadically stable and monadically dependent graph classes: characterizations and algorithmic meta-theorems
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Bremen, Universität Bremen, Dissertation, 2024
- Schlagwort
-
Graphentheorie
- Ereignis
-
Veröffentlichung
- (wo)
-
Bremen
- (wer)
-
Staats- und Universitätsbibliothek Bremen
- (wann)
-
2024
- Urheber
-
Mählmann, Nikolas
- Beteiligte Personen und Organisationen
- DOI
-
10.26092/elib/3338
- URN
-
urn:nbn:de:gbv:46-elib83045
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:54 MEZ
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
- Mählmann, Nikolas
- Siebertz, Sebastian
- Ossona de Mendez, Patrice
- Staats- und Universitätsbibliothek Bremen
Entstanden
- 2024
Ähnliche Objekte (12)
Stable Convergence and Stable Limit Theorems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Characterizations of Game Theoretic Solutions which Lead to Impossibility Theorems
An Algorithmic Meta Theorem for Homomorphism Indistinguishability
Rationalizing rational expectations: Characterizations and tests
Minimization, Characterizations, and Nondeterminism for Biautomata
Smoothness morrey spaces and differences : characterizations and applications
Characterizations and Algorithms for Special Digraph Classes
Implicit characterizations of FPTIME and NC revisited
Convergence theorems with a stable limit law
Formal Language Characterizations of P, NP, and PSPACE
Stable Convergence and Stable Limit Theorems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Characterizations of Game Theoretic Solutions which Lead to Impossibility Theorems
An Algorithmic Meta Theorem for Homomorphism Indistinguishability
Rationalizing rational expectations: Characterizations and tests
Minimization, Characterizations, and Nondeterminism for Biautomata
Smoothness morrey spaces and differences : characterizations and applications
Characterizations and Algorithms for Special Digraph Classes
Implicit characterizations of FPTIME and NC revisited
Convergence theorems with a stable limit law
Formal Language Characterizations of P, NP, and PSPACE
Stable Convergence and Stable Limit Theorems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Characterizations of Game Theoretic Solutions which Lead to Impossibility Theorems
An Algorithmic Meta Theorem for Homomorphism Indistinguishability
Rationalizing rational expectations: Characterizations and tests
Minimization, Characterizations, and Nondeterminism for Biautomata
Smoothness morrey spaces and differences : characterizations and applications
Characterizations and Algorithms for Special Digraph Classes
Implicit characterizations of FPTIME and NC revisited
Convergence theorems with a stable limit law