- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-0490
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement ; day:27 ; month:6 ; year:2016 ; pages:1-34
Theory of computing systems ; (27.6.2016), 1-34
- Creator
- Contributor
- DOI
-
10.1007/s00224-016-9686-0
- URN
-
urn:nbn:de:1111-201606288573
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:58 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Berkholz, Christoph
- Bonsma, Paul
- Grohe, Martin
- SpringerLink (Online service)
Other Objects (12)
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Albums and bound volumes of colour-prints
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Real Enumerative Invariants Relative to the Anti-Canonical Divisor and their Refinement
The Iteration Number of Colour Refinement: Q/A Session B - Paper B2.F
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Albums and bound volumes of colour-prints
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Real Enumerative Invariants Relative to the Anti-Canonical Divisor and their Refinement
The Iteration Number of Colour Refinement: Q/A Session B - Paper B2.F
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Albums and bound volumes of colour-prints
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Real Enumerative Invariants Relative to the Anti-Canonical Divisor and their Refinement