We survey recent results on the asymptotic complexity of some of the fundamental computational tasks in finite groups in a variety of computational models. A striking recent feature is that techniques motivated by the problems of the more abstract models (nondeterminism, extreme parallelization) have turned out to provide powerful tools in the design of surprisingly efficient algorithms on real...

Graphs with high symmetry or regularity are the main source for experimentally hard instances of the notoriously difficult graph isomorphism problem. In this paper, we study the computational complexity of isomorphism testing for line graphs of t-(v, k, λ) designs. For this class of highly regular graphs, we obtain a worst-case running time of O(v ) for bounded parameters t, k, λ. In a first st...

It is proven that finding the lexicographically greatest (smallest) string in the orbit of a given string under the position permuting action of a permutation group is an FP-complete problem. This gives an affirmative answer to an open problem of Babai and Luks (1983, Proc. 15th Annual ACM STOC): determining the value of the element at a given position in the lexicographically greatest (smalles...

Panton-Valentine Leukocidin (PVL) is a cytotoxin produced by Staphylococcus aureus that causes leukocyte destruction and tissue necrosis. Therefore, this study aimed to detect the rate, antimicrobial susceptibility, associated risk factors, phylogenetic relationship of PVL-positive S. nasal carriers among patients nurses. The research methods included collection 315 specimens obtained from inpa...

The existing palm-print verification schemes have demonstrated good verification performance when identity claims have to be verified based on palm-print images of adequate quality (e.g., acquired in controlled illumination conditions, free from distortions caused by the pressure applied to the surface of the scanner, etc.). However, most of these schemes struggle with their verification perfor...

Background. The ratio of CA-MRSA in children with impetigo has been increasing in Japan. Methods. Antimicrobial susceptibilities of 136 S. aureus isolates from children with impetigo were studied. Furthermore, molecular epidemiological analysis and virulence gene analysis were performed. Results. Of the 136 S. aureus isolates, 122 (89.7%) were MSSA and 14 (10.3%) were MRSA. Of the 14 MRSA strai...

Graph Isomorphism (GI) is one of a small number of natural algorithmic problems with unsettled complexity status in the P /NP theory: not expected to be NP-complete, yet not known to be solvable in polynomial time. Arguably, the GI problem boils down to filling the gap between symmetry and regularity, the former being defined in terms of automorphisms, the latter in terms of equations satisfied...

While in general it is not known whether there is a polynomial time algorithm to decide whether two given graphs are isomorphic, there are polynomial-time algorithms for certain subsets of graphs, including but not limited to planar graphs and graphs with bounded valence. In this thesis, we will give a brief introduction on the Graph Isomorphism Problem and its relations to complexity theory. W...

Staphylococcal leukocidin pores are formed by the obligatory interaction of two distinct polypeptides, one of class F and one of class S, making them unique in the family of beta-barrel pore-forming toxins (beta-PFTs). By contrast, other beta-PFTs form homo-oligomeric pores; for example, the staphylococcal alpha-hemolysin (alpha HL) pore is a homoheptamer. Here, we deduce the subunit compositio...