On Tuesday, July 9, 2019 at 1:47:50 AM UTC+2, Caleb Robelle wrote: > > I am using sage version 7.3 on Linux mint 18. I was wondering if there are > algorithms to count points of multivariate polynomials over finite fields > implemented in sage that were faster than a simple brute force search. I > haven't been able to find any on my own. Any advice would be appreciated. > Thanks! >
Define the ideal I generated by the polynomials and the field equations (of the form x^q-x with variable x and q order of the finite field). Then I.variety() computes the points using Groebner basis theory. -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-support. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/c8e5d0ae-5171-40ac-8446-b4007ec2d6e4%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
