Titlebook: Effective Methods in Algebraic Geometry; Teo Mora,Carlo Traverso Book 1991 Springer Science+Business Media New York 1991 Dimension.Mathema

Clientele

書目名稱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

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

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

不能逃避

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

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

AER

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

guardianship

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

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