Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-40450-4_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Tight Upper and Lower Bounds on the Path Length of Binary Trees

SIAM Journal on Computing
MathematicsComputer Science
1994English

Some Lower Bounds for the Complexity of Continuation Methods

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
1998English

Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1997English

Tight RMR Lower Bounds for Mutual Exclusion and Other Problems

2008English

Lower and Upper Bounds for Cohen-Macaulay Dimension

Bulletin of the Australian Mathematical Society
Mathematics
2005English

Upper and Lower Bounds for Ranks of the Matrix ExpressionX-XAX

Abstract and Applied Analysis
Applied MathematicsAnalysis
2013English

Robust Randomness Amplifiers: Upper and Lower Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Lower Bounds for the Linear Complexity of Sequences Over Residue Rings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Lower and Upper Bounds for the Time Constant of First-Passage Percolation

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy