Structured FFT and TFT: Symmetric and lattice polynomials

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we consider the problem of efficient computa- tions with structured polynomials. We provide complexity results for computing Fourier Transform and Truncated Fourier Transform of symmetric polynomials, and for mul- tiplying polynomials supported on a lattice.

Original languageEnglish
Title of host publicationISSAC 2013 - Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation
Pages355-362
Number of pages8
DOIs
Publication statusPublished - 23 Aug 2013
Event38th International Symposium on Symbolic and Algebraic Computation, ISSAC 2013 - Boston, MA, United States
Duration: 26 Jun 201329 Jun 2013

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Conference

Conference38th International Symposium on Symbolic and Algebraic Computation, ISSAC 2013
Country/TerritoryUnited States
CityBoston, MA
Period26/06/1329/06/13

Keywords

  • Lattice FFT
  • Symmetric FFT
  • TFT

Fingerprint

Dive into the research topics of 'Structured FFT and TFT: Symmetric and lattice polynomials'. Together they form a unique fingerprint.

Cite this