標(biāo)題: Titlebook: Effective Methods in Algebraic Geometry; Teo Mora,Carlo Traverso Book 1991 Springer Science+Business Media New York 1991 Dimension.Mathema [打印本頁] 作者: Clientele 時間: 2025-3-21 16:07
書目名稱Effective Methods in Algebraic Geometry影響因子(影響力)
書目名稱Effective Methods in Algebraic Geometry影響因子(影響力)學(xué)科排名
書目名稱Effective Methods in Algebraic Geometry網(wǎng)絡(luò)公開度
書目名稱Effective Methods in Algebraic Geometry網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Effective Methods in Algebraic Geometry被引頻次
書目名稱Effective Methods in Algebraic Geometry被引頻次學(xué)科排名
書目名稱Effective Methods in Algebraic Geometry年度引用
書目名稱Effective Methods in Algebraic Geometry年度引用學(xué)科排名
書目名稱Effective Methods in Algebraic Geometry讀者反饋
書目名稱Effective Methods in Algebraic Geometry讀者反饋學(xué)科排名
作者: CYN 時間: 2025-3-21 23:39
A simple constructive proof of Canonical Resolution of Singularities,) in characteristic zero. Full details will appear in [7]. The proof is a variation on our proof of local desingularization (“uniformization”) [4], [5], and justifies the philosophy that “a sufficiently good local choice [of centre of blowing-up] should globalize automatically” [5, p. 901]. The fina作者: choleretic 時間: 2025-3-22 00:34
On algorithms for real algebraic plane curves,logy of a real algebraic plane curve. Up till now, we can divide these algorithms into two main groups: those coding real algebraic numbers by means of isolating intervals (see for instance [3] and [7]) and those coding them à . (see [9]). The aim of this note is to survey the state of the art as fa作者: 不能逃避 時間: 2025-3-22 05:47
Duality methods for the membership problem, a polynomial by generators of a given ideal may involve doubly exponential (in the number of variables) degrees ([16]). The same difficulty arises when computing Gr?ebner bases of arbitrary polynomial ideals ([11]). This means that all known techniques to decide membership and to find representatio作者: Adulterate 時間: 2025-3-22 11:07
Efficient Algorithms and Bounds for Wu-Ritt Characteristic Sets,Wu Wen-Tsiin, in the late seventies. Since then Wu-Ritt Characteristic Sets have found wide applications in Symbolic Computational Algebra, Automated Theorem Proving in Elementary Geometries and Computer Vision. The original algorithm of Ritt, and subsequent modifications by Wu, has a non-elementary作者: AER 時間: 2025-3-22 16:44 作者: AER 時間: 2025-3-22 19:38
Codes and Elliptic Curves,ppa codes but rather with another link between coding theory and algebraic geometry. In our case the codes correspond to . of algebraic curves over a finite field, whereas Goppa codes come from a fixed algebraic curve. We use algebraic geometry to determine the weight distributions of certain codes 作者: liposuction 時間: 2025-3-23 00:16 作者: guardianship 時間: 2025-3-23 02:15
Membership problem, Representation problem and the Computation of the Radical for one-dimensional Iial ring .[..,…, ..] from a complexity point of view. Our aim is to give bounds for the complexity of the above problems which are simply exponential in the number . of variables in the one-dimensional case. Moreover we show that in the general case the first two problems are doubly exponential only作者: Interferons 時間: 2025-3-23 07:58
On the Complexity of Zero-dimensional Algebraic Systems,and/or all of its irreducible components in time .. where . is the maximal degree of the polynomials and . the number of variables. With probability nearly 1, no component is lost..This algorithm can decide zero-dimensionality with the same complexity and the same probability of success..These compl作者: Virtues 時間: 2025-3-23 12:04 作者: 座右銘 時間: 2025-3-23 14:37
Elementary constructive theory of ordered fields,However since Tarski (and even since Sturm and Sylvester) one knows how to compute in the real closure of an ordered field . solely by computations in .. This apparent contradiction is solved in this paper.作者: Preserve 時間: 2025-3-23 21:13
Effective real Nullstellensatz and variants,utes, for the input “a system of generalized signs conditions (.) on polynomials of .[.., .., …, ..] impossible to satisfy in the real closure of ., an algebraic identity that makes this impossibility evident. The main idea is to give an “algebraic identity version” of universal and existential axio作者: guzzle 時間: 2025-3-24 01:30 作者: 帶來墨水 時間: 2025-3-24 03:21 作者: 明確 時間: 2025-3-24 10:01 作者: Gyrate 時間: 2025-3-24 12:21 作者: Common-Migraine 時間: 2025-3-24 16:12 作者: Ossification 時間: 2025-3-24 20:55 作者: dowagers-hump 時間: 2025-3-24 23:53
https://doi.org/10.1007/978-3-642-51102-8We here give a method to calculate the resultant of three polynomials in terms of a square-free decomposition and resultants of two polynomials. After that, we show how the subresultant algorithm enables us to avoid many calculations..In the last part, we study the possible extension to the general case of . homogeneous polynomials in . variables.作者: 較早 時間: 2025-3-25 06:29 作者: affect 時間: 2025-3-25 09:56
Das Verbandswesen in der Kreditwirtschaft,Denote by .. = ..(.) = .[..,…, .., ..,…, ..] the Weyl algebra over a field .([2]) determined by the relations .... = ...., .... = ...., .... = .... ? 1, .... = .... for i ≠ j, and by the algebra of differential operators.作者: Stable-Angina 時間: 2025-3-25 12:59 作者: 委屈 時間: 2025-3-25 17:05 作者: FACET 時間: 2025-3-25 23:38 作者: interference 時間: 2025-3-26 04:04
,Exemples d’ensembles de Points en Position Uniforme,Un ensemble . de . points d’un espace affine, dont les équations forment un idéal de polyn?mes de colongueur ., est en position uniforme si pour tout sous-ensemble de .′ points .′ de . la fonction de Hilbert de .′ ne dépend que de .′.作者: forecast 時間: 2025-3-26 05:49 作者: Neutropenia 時間: 2025-3-26 11:10 作者: 有罪 時間: 2025-3-26 13:35 作者: 公共汽車 時間: 2025-3-26 18:25
978-1-4612-6761-4Springer Science+Business Media New York 1991作者: exclamation 時間: 2025-3-27 00:59
https://doi.org/10.1007/978-3-658-17415-6, by means of algorithms with computably bounded complexity. It is also a fact that semi-algebraic objects have some . finiteness properties. Hence the interest in finding reasonably ”fast” algorithms or “sharp” bounds. Neverthless, on the other side of the mainstream, one can be interested in .. We作者: RAFF 時間: 2025-3-27 03:12
https://doi.org/10.1007/978-3-658-01234-2) in characteristic zero. Full details will appear in [7]. The proof is a variation on our proof of local desingularization (“uniformization”) [4], [5], and justifies the philosophy that “a sufficiently good local choice [of centre of blowing-up] should globalize automatically” [5, p. 901]. The fina作者: 起波瀾 時間: 2025-3-27 06:08 作者: craving 時間: 2025-3-27 10:16 作者: LIMN 時間: 2025-3-27 15:19
https://doi.org/10.1007/978-3-642-49659-2Wu Wen-Tsiin, in the late seventies. Since then Wu-Ritt Characteristic Sets have found wide applications in Symbolic Computational Algebra, Automated Theorem Proving in Elementary Geometries and Computer Vision. The original algorithm of Ritt, and subsequent modifications by Wu, has a non-elementary作者: V切開 時間: 2025-3-27 19:25 作者: Vertical 時間: 2025-3-27 22:59 作者: CHARM 時間: 2025-3-28 03:59 作者: 全等 時間: 2025-3-28 09:51 作者: dendrites 時間: 2025-3-28 13:25 作者: 變化 時間: 2025-3-28 16:26
https://doi.org/10.1007/978-3-322-97571-3in terms of the output length, . they work in time .(..), for all δ > 0, where . is an a priori bound on the length of the output. Since we require time Ω(.) just to write down the output the algorithms are close to optimal. The algorithm for inverse uses a technique referred to as dynamic evaluatio作者: 主動脈 時間: 2025-3-28 22:34 作者: Stable-Angina 時間: 2025-3-28 23:39
Bilder von Zwillingskristallen,utes, for the input “a system of generalized signs conditions (.) on polynomials of .[.., .., …, ..] impossible to satisfy in the real closure of ., an algebraic identity that makes this impossibility evident. The main idea is to give an “algebraic identity version” of universal and existential axio作者: 現(xiàn)代 時間: 2025-3-29 06:20
Patrick S. F?hl,Patrick Glogner-Pilz: Dodgson’s method [1], Bareiss’s method [2] and two methods of the author — method by forward and back-up procedures [3] and a one-pass method [4]..We show that for the number of coefficient operations, or for the number of operations in the finite rings, or for modular computation in the polynomia作者: CLIFF 時間: 2025-3-29 08:08 作者: 盡責(zé) 時間: 2025-3-29 12:22 作者: 遷移 時間: 2025-3-29 15:46
Algorithms for a Multiple Algebraic Extension,me Ω(.) just to write down the output the algorithms are close to optimal. The algorithm for inverse uses a technique referred to as dynamic evaluation for computing in algebraic extensions defined by reducible polynomials.作者: 睨視 時間: 2025-3-29 20:58 作者: 過去分詞 時間: 2025-3-30 02:03
https://doi.org/10.1007/978-3-658-01234-2l version is surprisingly elementary; these notes, for example, include an essentially self-contained presentation of the hypersurface case. The general case involves a “reduction to the hypersurface case” result from [5].作者: DIKE 時間: 2025-3-30 04:43 作者: 出處 時間: 2025-3-30 12:09
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.作者: 現(xiàn)代 時間: 2025-3-30 16:07 作者: 固執(zhí)點好 時間: 2025-3-30 20:21
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 作者: 兩棲動物 時間: 2025-3-31 04:54
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
,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 [9] is true.作者: Autobiography 時間: 2025-3-31 09:14 作者: defile 時間: 2025-3-31 13:56
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 [4] is the best. The method of forward and back-up procedures [3] is the best for the polynomial rings when we make use of classical algorithms for polynomial operations.作者: Vulnerary 時間: 2025-3-31 20:47
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
