arXiv · math/0406085
Fast computation of a rational point of a variety over a finite field
Abstract
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system (called its degree), which is always bounded by the Bezout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.
Explore related subjects
Keep this discovery
Antonio Cafure, Guillermo Matera. 2004-06-04. Fast computation of a rational point of a variety over a finite field. https://arxiv.org/abs/math/0406085
Cite the original work for its findings. Save a collection to share your selection of sources.