- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Berlin, Humboldt Universität zu Berlin, Diss., 2011
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Humboldt Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II
- (wann)
-
2011
- Urheber
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:kobv:11-100192373
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:33 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
- Eickmeyer, Kord
- Grohe, Martin
- Schweikardt, Nicole
- Bro Miltersen, Peter
- Humboldt Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II
Entstanden
- 2011
Ähnliche Objekte (12)
The structure of fixed-point logics
The complexity of finite variable theories
Parameterized complexity theory
Weisfeiler and Leman’s Unlikely Journey from Graph Isomorphism to Neural Networks
Descriptive complexity of learning
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
The theory of infinite probabilistic databases
The structure of graphs and new logics for the characterization of Polynomial Time
Parameterized and exact computation : third international workshop ; proceedings
The succinctness of first-order logic on linear orders
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus
The structure of fixed-point logics
The complexity of finite variable theories
Parameterized complexity theory
Weisfeiler and Leman’s Unlikely Journey from Graph Isomorphism to Neural Networks
Descriptive complexity of learning
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
The theory of infinite probabilistic databases
The structure of graphs and new logics for the characterization of Polynomial Time
Parameterized and exact computation : third international workshop ; proceedings
The succinctness of first-order logic on linear orders
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus
The structure of fixed-point logics
The complexity of finite variable theories
Parameterized complexity theory
Weisfeiler and Leman’s Unlikely Journey from Graph Isomorphism to Neural Networks
Descriptive complexity of learning
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
The theory of infinite probabilistic databases
The structure of graphs and new logics for the characterization of Polynomial Time
Parameterized and exact computation : third international workshop ; proceedings
The succinctness of first-order logic on linear orders