Name
Abstract | ||
|---|---|---|
We solve two computational problems concerning plane algebraic curves over finite fields: generating an (approximately) uniform random point, and finding all points deterministically in amortized polynomial time (over a prime field, for non-exceptional curves). |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1137/S0097539799351018 | FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science |
Keywords | Field | DocType |
computational problem,plane algebraic curve,finite fields,finite field,points deterministically,prime field,amortized polynomial time,nonexceptional curve,random point,computer algebra,random sampling,polynomial time,probabilistic algorithms,algebraic curve,algebraic geometry,algebraic curves | Randomized algorithm,Discrete mathematics,Finite field,Computational problem,Algebraic geometry,Combinatorics,Family of curves,Algebraic curve,Symbolic computation,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 6 | 0097-5397 |
ISBN | Citations | PageRank |
0-8186-7183-1 | 7 | 0.77 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joachim von zur Gathen | 1 | 10 | 1.34 |
| Igor E. Shparlinski | 2 | 1339 | 164.66 |
| Alistair Sinclair | 3 | 1506 | 308.40 |