出处
发表于 2025-3-30 12:09:23
https://doi.org/10.1007/978-3-322-89237-9but also we show that results from coding theory may be used to obtain results about the variation of the number of points in families of algebraic curves over a finite field. We do not assume that the reader has a knowledge of coding theory.
现代
发表于 2025-3-30 16:07:44
http://reply.papertrans.cn/31/3028/302788/302788_52.png
固执点好
发表于 2025-3-30 20:21:36
Bilder von Zwillingskristallen,ms of the theory of real closed fields, and of the simplest deduction rules of this theory (as Modus Ponens). We apply this idea to the Hörmander algorithm, which is the conceptually simplest test for the impossibility of a . system in the real closure of an ordered field.
Dorsal-Kyphosis
发表于 2025-3-31 00:00:28
http://reply.papertrans.cn/31/3028/302788/302788_54.png
两栖动物
发表于 2025-3-31 04:54:51
https://doi.org/10.1007/978-3-658-17415-6e interest in finding reasonably ”fast” algorithms or “sharp” bounds. Neverthless, on the other side of the mainstream, one can be interested in .. We are going to see some examples and to discuss shortly some possible . of such a lack.
osculate
发表于 2025-3-31 05:01:15
,Kreditwürdigkeit von Privatkunden,rticular, we prove that if . is a graded standard finitely presented strictly ordered algebra, then . is right (left) noetherian if and only if . has polynomial growth. In this case . is almost commutative. It follows from this that the conjecture we made in is true.
Autobiography
发表于 2025-3-31 09:14:14
http://reply.papertrans.cn/31/3028/302788/302788_57.png
defile
发表于 2025-3-31 13:56:49
Patrick S. Föhl,Patrick Glogner-Pilze show that for the number of coefficient operations, or for the number of operations in the finite rings, or for modular computation in the polynomial rings the one-pass method is the best. The method of forward and back-up procedures is the best for the polynomial rings when we make use of classical algorithms for polynomial operations.
Vulnerary
发表于 2025-3-31 20:47:01
Book 1991uote from the "Call for papers" - were the fol lowing: - Effective methods and complexity issues in commutative algebra, pro jective geometry, real geometry, algebraic number theory - Algebraic geometric methods in algebraic computing Contributions in related fields (computational aspects of group