OpenAlex
PricingAboutJobs
Log inGet started
Work

Factoring Groups Efficiently

HTML

Year: 2009
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Automata, Languages and Programming: 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I
DOI: 10.1007/978-3-642-02927-1_49
Authors: Neeraj Kayal, Timur Nezhmetdinov
Institutions: Microsoft Research (India), Lehigh University
Language: English

Topic: Finite Group Theory Research
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Keywords: finite groups, direct product decomposition, multiplication tables, polynomial-time algorithms, subgroup decomposition, computational group theory

Open Access status: closed
OpenAlex ID: W72029833
FWCI: 1.576
Cites: 15
Cited by: 36
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security