Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > DETERMINISTIC LOGSPACE:
Reports tagged with Deterministic Logspace:
TR14-070 | 14th May 2014
Vikraman Arvind, Gaurav Rattan

#### The Complexity of Geometric Graph Isomorphism

We study the complexity of Geometric Graph Isomorphism, in
$l_2$ and other $l_p$ metrics: given two sets of $n$ points $A, B\subset \mathbb{Q}^k$ in
$k$-dimensional euclidean space the problem is to
decide if there is a bijection $\pi:A \rightarrow B$ such that for
... more >>>

ISSN 1433-8092 | Imprint