Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICALP
2009
Springer

favoriteEmaildiscussreport

95views Programming Languages» more ICALP 2009»

Factoring Groups Efficiently

14 years 4 months ago

Factoring Groups Efficiently

Download dimax.rutgers.edu

We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two subgroups A and B of G such that G is the direct product of A and B, if such a decomposition exists.

Neeraj Kayal, Timur Nezhmetdinov

Real-time Traffic

ICALP 2009 | Multiplication Table | Polynomial Time Algorithm | Theoretical Computer Science |

claim paper

Related Content

» Simultaneous prediction of transcription factor binding sites in a group of prokaryotic ge...

» An Efficient TreeBased Group Key Agreement Using Bilinear Map

» Understanding ParentInfant Behaviors Using Nonnegative Matrix Factorization

» Factors mediating the routinisation of elearning within a traditional university education...

» Algorithms for ray class groups and Hilbert class fields

» Online Learning for Group Lasso

» The effects of group composition on decision quality in a social production community

» Perceptual Grouping for Contour Extraction

» Bass Cyclic Units as Factors in a Free Group in Integral Group Ring Units

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2009
Where	ICALP
Authors	Neeraj Kayal, Timur Nezhmetdinov

Comments (0)