Grohe, Martin, 1967-....
Grohe, M. (Martin)
Grohe, Martin.
Martin Grohe deutscher Mathematiker und Informatiker
VIAF ID: 3185314 ( Personal )
Permalink: http://viaf.org/viaf/3185314
Preferred Forms
-
-
- 100 1 _ ‡a Grohe, M. ‡q (Martin)
- 100 1 _ ‡a Grohe, M. ‡q (Martin)
-
-
-
-
-
- 100 1 _ ‡a Grohe, Martin ‡d 1967-
- 100 1 _ ‡a Grohe, Martin ‡d 1967-
-
- 100 1 _ ‡a Grohe, Martin, ‡d 1967-....
-
- 100 0 _ ‡a Martin Grohe ‡c deutscher Mathematiker und Informatiker
4xx's: Alternate Name Forms (10)
5xx's: Related Names (8)
- 510 2 _ ‡a American Mathematical Society
- 510 2 _ ‡a Association for Symbolic Logic
- 510 2 _ ‡a Freiburg (Breisgau), University
- 510 2 _ ‡a Humboldt-Universität zu Berlin ‡e Affiliation
- 510 2 _ ‡a IWPEC 2008 (2008 : Victoria, B.C.)
- 510 2 _ ‡a IWPEC 3, 2008, Victoria, British Columbia
- 510 2 _ ‡a Springer Science+Business Media
- 510 2 _ ‡a Universität Berlin
Works
Title | Sources |
---|---|
About documenta : Ausstellung in der Neuen Galerie | |
Classification of properties and their relation to chemical bonding Essential steps toward the inverse design of functional materials | |
complexity of finite variable theories | |
Database Repairing with Soft Functional Dependencies | |
A decomposition-compatible canonization framework for the graph isomorphism problem | |
Definable decompositions for graphs of bounded linear cliquewidth | |
Descriptive complexity, canonisation, and definable graph structure theory | |
Deskriptive Komplexität des Lernens | |
double arity hierarchy theorem for transitive closure logic | |
A Finite-Model-Theoretic View on Propositional Proof Complexity | |
Fixed-parameter tractability and logic | |
Graph machine learning for design of high-octane fuels | |
Graph Similarity and Approximate Isomorphism | |
Homomorphism Tensors and Linear Equations | |
An Improved Isomorphism Test for Bounded-Tree-Width Graphs | |
IWPEC 2008 | |
Learning on graphs with logic and neural networks | |
Lernen auf Graphen mit Logik und Neuronalen Netzen | |
Leveraging the structure of uncertain data. | |
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus | |
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs | |
Lovász Meets Weisfeiler and Leman | |
Lower Bounds for Heuristic Algorithms | |
Model checking problems as a basis for parameterized intractability | |
Model theoretic methods in finite combinatorics : AMS-ASL joint special session, January 5-8, 2009, Washington, DC | |
Modelling the effect of groups on network structure and dynamics | |
On graph sparsity and structure colourings and graph decompositions | |
Parameterized and exact computation third international workshop ; proceedings | |
Parameterized complexity theory, c2006: | |
power of algorithmic approaches to the graph isomorphism problem | |
Randomness in complexity theory and logics | |
L-Recursion and a new Logic for Logarithmic Space | |
Space efficient algorithms for graph isomorphism and representation | |
Sparse instances of hard problems | |
Stärke algorithmischer Ansätze für das Graphisomorphieproblem | |
Stärken und Grenzen des Weisfeiler-Leman-Algorithmus | |
Strategies in infinite games structured reactive programs and transducers over infinite alphabets | |
structure of fixed-point logics | |
structure of graphs and new logics for the characterization of Polynomial Time | |
theory of infinite probabilistic databases | |
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement | |
Tirer parti de la structure des données incertaines | |
Untere Schranken für heuristische Algorithmen | |
Weisfeiler and Leman’s Unlikely Journey from Graph Isomorphism to Neural Networks | |
Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark | |
Zur Struktur dessen, was wirklich berechenbar ist |