Mutant Zhuang-Zi algorithm

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present a new variant of the Zhuang-Zi algorithm, which solves multivariate polynomial equations over a finite field by converting it into a single variable problem over a large extension field. The improvement is based on the newly developed concept of mutant in solving multivariate equations. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Ding, J., & Schmidt, D. S. (2010). Mutant Zhuang-Zi algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6061 LNCS, pp. 28–40). https://doi.org/10.1007/978-3-642-12929-2_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free