Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time

Jianting Yang, Ke Ye, Lihong Zhi

Type: Article

Publication Date: 2024-07-10

Citations: 0

DOI: https://doi.org/10.1016/j.acha.2024.101686

View Publication

Download PDF

Locations

arXiv (Cornell University) - View - PDF
Applied and Computational Harmonic Analysis - View

Similar Works

Action	Title	Year	Authors
+	Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time	2022	Jianting Yang Ke Ye Lihong Zhi
+ PDF Chat	Computing Sparse Fourier Sum of Squares on Finite Abelian Groups in Quasi-Linear Time1	2023	Lihong Zhi Jianting Yang Ke Ye
+	Sparse sums of squares on finite abelian groups and improved semidefinite lifts	2016	Hamza Fawzi James Saunderson Pablo A. Parrilo
+	Existence and efficient construction of fast Fourier transforms on supersolvable groups	1991	Ulrich Baum
+ PDF Chat	Computing Sparse Multiples of Polynomials	2010	Mark Giesbrecht Daniel S. Roche Hrushikesh Tilak
+ PDF Chat	Computing Sparse Multiples of Polynomials	2012	Mark Giesbrecht Daniel S. Roche Hrushikesh Tilak
+	Computing sum of squares decompositions with rational coefficients	2008	Helfried Peyrl Pablo A. Parrilo
+ PDF Chat	Bit complexity of polynomial GCD on sparse representation	2024	Qiao-Long Huang Xiao-Shan Gao
+	Reconstruction of Fourier Sparse Signals over Elementary Abelian Groups	2013	Lucia Morotti
+	Efficient computation of Fourier transforms on compact groups	1998	David K. Maslen
+	Calculation of Fourier transforms on finite Abelian groups	1970	G. G. Apple P. A. Wintz
+ PDF Chat	MATRICES OF FINITE ABELIAN GROUPS, FINITE FOURIER TRANSFORM AND CODES	2013	Shigeru Kanemitsu Michel Waldschmidt
+ PDF Chat	A Polynomial Time Algorithm for Calculating Fourier-Dedekind Sums	2024	Guoce Xin Xinyu Xu
+	Sums of an Even Number of Squares	2008
+	A Fast Program Generator of Fast Fourier Transforms	1999	Michael Clausen Meinard Müller
+	Sums of squares of integers	2006
+	Computing subfields of number fields and applications to Galois group computations	2020	Vela del Olmo Maria Montserrat
+	A fast generalized DFT for finite groups of Lie type	2017	Chloe Hsu Chris Umans
+ PDF Chat	Sparse polynomial exponential sums	2003	Todd Cochrane Christopher Pinner Jason Rosenhouse
+ PDF Chat	Efficient computation of Fourier inversion for finite groups	1994	Daniel N. Rockmore

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (18)

Action	Title	Year	Authors
+	Representation Theory: A First Course	1991	William Fulton
+ PDF Chat	Sums of squares on the hypercube	2016	Grigoriy Blekherman João Gouveia James Pfeiffer
+	A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices	2010	Naonori Kakimura
+	SDPT3 — A Matlab software package for semidefinite programming, Version 1.3	1999	Kim-Chuan Toh Michael J. Todd Reha Tütüncü
+	Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients	2011	Erich Kaltofen Bin Li Zhengfeng Yang Lihong Zhi
+	Sums of squares based approximation algorithms for MAX-SAT	2007	Hans van Maaren Linda van Norden Marijn J. H. Heule
+ PDF Chat	Truncation errors in two Chebyshev series approximations	1965	David Elliott
+ PDF Chat	Stable signal recovery from incomplete and inaccurate measurements	2006	Emmanuel J. Candès Justin Romberg Terence Tao
+ PDF Chat	Sums of Hermitian Squares and the BMV Conjecture	2008	Igor Klep Markus Schweighofer
+	Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems	2017	Shinsaku Sakaue Akiko Takeda Sunyoung Kim Naoki Ito