Algorithms for Modular Counting of Roots of Multivariate Polynomials-Reference-Cited by-同舟云学术

Algorithms for Modular Counting of Roots of Multivariate Polynomials

Published:2007-10-17 Issue:4 Volume:50 Page:479-496
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Gopalan Parikshit,Guruswami Venkatesan,Lipton Richard J.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-007-9097-3.pdf

Reference30 articles.

1. LNCS;L. Adleman,1996

2. Artin, M.: Algebra. Prentice Hall, New York (1991)

3. Beigel, R., Tarui, J.: On ACC. Comput. Complex. 4, 350–366 (1994)

4. Ehrenfeucht, A., Karpinski, M.: The computational complexity of (xor, and)-counting problems. Tech. Report 8543-CS, ICSI, Berkeley (1990)

5. Grigoriev, D., Karpinski, M.: An approximation algorithm for the number of zeroes of arbitrary polynomials over GF[q]. In: Proc. 32nd IEEE Symposium on Foundations of Computer Science (FOCS’91), pp. 662–669 (1991)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving polynomial systems over non-fields and applications to modular polynomial factoring;Journal of Symbolic Computation;2024-11

2. An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

3. Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory;IEEE Transactions on Information Theory;2023-02

4. Infinitely Many Quasi-Coincidence Point Solutions of Multivariate Polynomial Problems;Abstract and Applied Analysis;2013