Real-time simultaneous pose and shape estimation for articulated objects using a single depth camera
In this paper we present a novel real-time algorithm for simultaneous pose and shape
estimation for articulated objects, such as human beings and animals. The key of our pose …
estimation for articulated objects, such as human beings and animals. The key of our pose …
Faster Isomorphism for 𝑝-Groups of Class 2 and Exponent 𝑝
X Sun - Proceedings of the 55th Annual ACM Symposium on …, 2023 - dl.acm.org
The group isomorphism problem determines whether two groups, given by their Cayley
tables, are isomorphic. For groups with order n, an algorithm with n (log n+ O (1)) running …
tables, are isomorphic. For groups with order n, an algorithm with n (log n+ O (1)) running …
On p-Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors
In this article, we study some classical complexity-theoretic questions regarding Group
Isomorphism (GpI). We focus on p-groups (groups of prime power order) with odd p, which …
Isomorphism (GpI). We focus on p-groups (groups of prime power order) with odd p, which …
On the Weisfeiler-Leman dimension of finite groups
J Brachter, P Schweitzer - Proceedings of the 35th Annual ACM/IEEE …, 2020 - dl.acm.org
In comparison to graphs, combinatorial methods for the isomorphism problem of finite
groups are less developed than algebraic ones. To be able to investigate the descriptive …
groups are less developed than algebraic ones. To be able to investigate the descriptive …
Polynomial-time isomorphism test for groups with no abelian normal subgroups
We consider the problem of testing isomorphism of groups of order n given by Cayley tables.
The trivial n log n bound on the time complexity for the general case has not been improved …
The trivial n log n bound on the time complexity for the general case has not been improved …
Polynomial-time isomorphism test for groups with Abelian Sylow towers
We consider the problem of testing isomorphism of groups of order n given by Cayley tables.
The trivial n^{log n} bound on the time complexity for the general case has not been …
The trivial n^{log n} bound on the time complexity for the general case has not been …
Algorithms for group isomorphism via group extensions and cohomology
The isomorphism problem for finite groups of order n (GpI) has long been known to be
solvable in n^\logn+O(1) time, but only recently were polynomial-time algorithms designed …
solvable in n^\logn+O(1) time, but only recently were polynomial-time algorithms designed …
Bidirectional collision detection and faster deterministic isomorphism testing
DJ Rosenbaum - arxiv preprint arxiv:1304.3935, 2013 - arxiv.org
In this work, we introduce bidirectional collision detection---a new algorithmic tool that
applies to the collision problems that arise in many isomorphism problems. For the group …
applies to the collision problems that arise in many isomorphism problems. For the group …
Count-Free Weisfeiler--Leman and Group Isomorphism
NA Collins, M Levet - arxiv preprint arxiv:2212.11247, 2022 - arxiv.org
We investigate the power of counting in\textsc {Group Isomorphism}. We first leverage the
count-free variant of the Weisfeiler--Leman Version I algorithm for groups (Brachter & …
count-free variant of the Weisfeiler--Leman Version I algorithm for groups (Brachter & …
Breaking the nlog n Barrier for Solvable-Group Isomorphism
DJ Rosenbaum - Proceedings of the twenty-fourth annual ACM-SIAM …, 2013 - SIAM
We consider the group isomorphism problem: given two finite groups G and H specified by
their multiplication tables, decide if G≅ H. The n log n barrier for group isomorphism has …
their multiplication tables, decide if G≅ H. The n log n barrier for group isomorphism has …