88 search results - page 11 / 18 » Computing automorphisms of semigroups |
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
STACS
1992
Springer
13 years 11 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study the group-valued and semigroup-valued conservation laws in cellular automata (CA). We provide examples to distinguish between semigroup-valued, group-valued and ...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We propose a novel Riemannian framework for comparing signals and images in a manner that is invariant to their levels of blur. This framework uses a log-Fourier representation of...
DAC
2008
ACM
14 years 8 months ago
2008
ACM
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...