Whittaker Coefficients of Metaplectic Eisenstein Series
- 期刊名称Geometric and Functional Analysis
- 作者Brubaker, Benjamin; Friedberg, Solomon
- 卷第25卷
- 期第4期
- 印刷ISSN1016-443X
- 电子ISSN1420-8970
- 文件大小1065.21KB
- 发表时间2015-7
- DOI10.1007/s00039-015-0329-4
- 页码1180-1239
Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-inKarnin, Zohar S.; Mukhopadhyay, Partha; Shpilka, Amir; Volkovich, Ilya · SIAM Journal on Computing · 2013
[ACM Press the 40th annual ACM symposium - Victoria, British Columbia, Canada (2008.05.17-2008.05.20)] Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08 - Read-once polynomial identity testingShpilka, Amir; Volkovich, Ilya · 2008
[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-inKarnin, Zohar S.; Mukhopadhyay, Partha; Shpilka, Amir; Volkovich, Ilya · 2010
An editorialJoachim von zur Gathen · Computational Complexity · 1991
Instructions for preparing camera-ready manuscriptsComputational Complexity · 1991
Decompositions of algebras over ℝ and ℂWayne Eberly · Computational Complexity · 1991
Improving known solutions is hardDesh Ranjan; Suresh Chari; Pankaj Rohatgi · Computational Complexity · 1993
Parallel pointer machinesStephen A. Cook; Patrick W. Dymond · Computational Complexity · 1993
A deterministic test for permutation polynomialsI. E. Shparlinski · Computational Complexity · 1992
Counting curves and their projectionsJoachim von zur Gathen; Marek Karpinski; Igor Shparlinski · Computational Complexity · 1996-1997
The hardness of approximation: Gap locationErez Petrank · Computational Complexity · 1994