### Abstract

For more than 35 years, the fastest known method for integer multiplication has been the Schönhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions there is a corresponding (n log n) lower bound. The prevailing conjecture has always been that the complexity of an optimal algorithm is (n log n). We present a major step towards closing the gap from above by presenting an algorithm running in time n log n, 2 ^{O(log*n)}. The main result is for boolean circuits as well as for multitape Turing machines, but it has consequences to other models of computation as well.

Original language | English (US) |
---|---|

Title of host publication | STOC'07 |

Subtitle of host publication | Proceedings of the 39th Annual ACM Symposium on Theory of Computing |

Pages | 57-66 |

Number of pages | 10 |

DOIs | |

State | Published - Oct 30 2007 |

Event | STOC'07: 39th Annual ACM Symposium on Theory of Computing - San Diego, CA, United States Duration: Jun 11 2007 → Jun 13 2007 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

ISSN (Print) | 0737-8017 |

### Other

Other | STOC'07: 39th Annual ACM Symposium on Theory of Computing |
---|---|

Country | United States |

City | San Diego, CA |

Period | 6/11/07 → 6/13/07 |

### All Science Journal Classification (ASJC) codes

- Software

## Fingerprint Dive into the research topics of 'Faster integer multiplication'. Together they form a unique fingerprint.

## Cite this

Furer, M. (2007). Faster integer multiplication. In

*STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing*(pp. 57-66). (Proceedings of the Annual ACM Symposium on Theory of Computing). https://doi.org/10.1145/1250790.1250800