Cox–Zucker machine: Difference between revisions
Content deleted Content added
m +clarity |
No edit summary |
||
| Line 2: | Line 2: | ||
The '''Cox-Zucker machine''' is an [[algorithm]] created by [[David Cox]] and [[Steven Zucker]]. |
The '''Cox-Zucker machine''' is an [[algorithm]] created by [[David Cox]] and [[Steven Zucker]]. |
||
The algorithm was first published the 1979 paper "Intersection numbers of sections of [[elliptic surfaces]]" by Cox and |
The algorithm was first published the 1979 paper "Intersection numbers of sections of [[elliptic surfaces]]" by Cox and Zucker and it was later named the "Cox-Zucker machine" by [[Charles Schwartz]] in 1984. |
||
== References == |
== References == |
||
Revision as of 16:13, 21 December 2010
 | This article provides insufficient context for those unfamiliar with the subject. (February 2008) |
The Cox-Zucker machine is an algorithm created by David Cox and Steven Zucker.
The algorithm was first published the 1979 paper "Intersection numbers of sections of elliptic surfaces" by Cox and Zucker and it was later named the "Cox-Zucker machine" by Charles Schwartz in 1984.
References
- Cox, D. A. (1979). "Intersection numbers of sections of elliptic surfaces". Invent. Math. 53: 1–44. doi:10.1007/BF01403189.
{{cite journal}}: Unknown parameter|coauthors=ignored (|author=suggested) (help) - Schwartz, C. F. (1984). "A Mordell-Weil Group of Rank 8, and a Subgroup of Finite Index" (PDF). Nagoya Math J. 93: 17–26.
 | This geometry-related article is a stub. You can help Wikipedia by expanding it. |