Counting the Solutions of a System of Equations over Finite Field is NP-Hard

DOI10.1007/978-3-642-15660-1_76zbMath1255.05149OpenAlexW2184122985MaRDI QIDQ3145813

Hong Lin

Publication date: 14 December 2012

Published in: Quantitative Logic and Soft Computing 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15660-1_76

zbMATH Keywords

finite fieldperfect matchingNP-hard problem

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)