As far as I know the answer is "no" except for elliptic and hyperelliptic curves.
John Cremona On Tue, 9 Jul 2019 at 00:47, Caleb Robelle <[email protected]> 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! > > -- > 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/4b29a324-6474-4a2e-8020-58712bae2ddb%40googlegroups.com > <https://groups.google.com/d/msgid/sage-support/4b29a324-6474-4a2e-8020-58712bae2ddb%40googlegroups.com?utm_medium=email&utm_source=footer> > . > For more options, visit https://groups.google.com/d/optout. > -- 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/CAD0p0K4BaEpBAj0odPrS6Grcx5GbdOksnYCwmqm8vCOaXoa%3DQg%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
