Abstract

AbstractWe present a new fast search algorithm for 〈

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title
Journal
Date
Author
A framework for practical parallel fast matrix multiplication
Austin R Benson ... Grey Ballard
-
Austin R Benson, et. al.Austin R Benson ... Grey Ballard
24 Jan 2015
A framework for practical parallel fast matrix multiplication
Austin R Benson ... Grey Ballard
ACM SIGPLAN Notices | VOL. 50
Austin R Benson, et. al.Austin R Benson ... Grey Ballard
24 Jan 2015
Approximate inverse preconditioner for near resonant scattering problems
C.H Ahn ... W.C Chew
-
C.H Ahn, et. al.C.H Ahn ... W.C Chew
21 Jun 1998
Graph expansion and communication costs of fast matrix multiplication
Grey Ballard ... James Demmel
-
Grey Ballard, et. al.Grey Ballard ... James Demmel
04 Jun 2011
View more papers

More From: Groups - Complexity - Cryptology

Paper Title
Journal
Date
Author
On isomorphisms to a free group and beyond
Vladimir Shpilrain
Groups - Complexity - Cryptology | VOL. Volume 16, Issue 1
Vladimir ShpilrainVladimir Shpilrain
20 May 2024
Cayley Linear-Time Computable Groups
Prohrak Kruengthomya ... Dmitry Berdinsky
Groups - Complexity - Cryptology | VOL. Volume 15, Issue 2
Prohrak Kruengthomya, et. al.Prohrak Kruengthomya ... Dmitry Berdinsky
03 Apr 2024
Amenability problem for Thompson's group $F$: state of the art
Victor Guba
Groups - Complexity - Cryptology | VOL. Volume 15, Issue 1
Victor GubaVictor Guba
19 Oct 2023
Bounding conjugacy depth functions for wreath products of finitely generated abelian groups
Michal Ferov ... Mark Pengitore
Groups - Complexity - Cryptology | VOL. Volume 15, Issue 1
Michal Ferov, et. al.Michal Ferov ... Mark Pengitore
28 Sep 2023
View more papers