On Tractable Exponential Sums

DOI10.1007/978-3-642-14553-7_16zbMath1288.68104arXiv1005.2632OpenAlexW1484588855MaRDI QIDQ3587346

Xi Chen, Richard J. Lipton, Pinyan Lu, Jin-Yi Cai

Publication date: 7 September 2010

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.2632

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems ⋮ Counting Solutions to Polynomial Systems via Reductions ⋮ FKT is not universal -- a planar holant dichotomy for symmetric constraints ⋮ Classical simulation of quantum circuits by half Gauss sums

This page was built for publication: On Tractable Exponential Sums