A complex-number Fourier technique for lower bounds on the mod-\(m\) degree
type: Item
instance of: scholarly article
title: A complex-number Fourier technique for lower bounds on the mod-\(m\) degree
zbMATH Open document ID: 0963.68075
DOI: 10.1007/PL00001599
author: Frederic Green
published in: Computational Complexity
publication date: 2000-12-19T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1545263
zbMATH Keywords: circuit complexity
zbMATH Keywords: modulo functions
MaRDI profile type: Publication
Recommended article: Complex polynomials and circuit lower bounds for modular counting
Recommended article: Q3216738
Recommended article: Q3410340
Recommended article: A LOWER BOUND FOR THE LARGE SIEVE WITH SQUARE MODULI
Recommended article: An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial
Recommended article: A lower bound for the multiplication of polynomials modulo a polynomial
Recommended article: The Fourier restriction and Kakeya problems over rings of integers modulo N
Recommended article: Bounds for Waring's number mod \(\mathcal P^m\) in number fields
Recommended article: Optimal bounds for Büchi's problem in modular arithmetic
Recommended article: Q3639542
description: scientific article; zbMATH DE number 1545263