Pages that link to "Item:Q5191525"
From MaRDI portal
The following pages link to FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191525):
Displaying 6 items.
- Beating the generator-enumeration bound for \(p\)-group isomorphism (Q500988) (← links)
- Linear and sublinear time algorithms for the basis of abelian groups (Q553345) (← links)
- An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism (Q1816737) (← links)
- Linear time algorithms for Abelian group isomorphism and related problems (Q2643019) (← links)
- Efficient algorithms for the basis of finite abelian groups (Q2905283) (← links)
- Nearly linear time isomorphism algorithms for some nonabelian group classes (Q5918355) (← links)