Titlebook: Computer Algebra in Scientific Computing; 20th International W Vladimir P. Gerdt,Wolfram Koepf,Evgenii V. Vorozht Conference proceedings 20

兩邊在擴散

書目名稱Computer Algebra in Scientific Computing影響因子(影響力)




書目名稱Computer Algebra in Scientific Computing影響因子(影響力)學科排名




書目名稱Computer Algebra in Scientific Computing網(wǎng)絡公開度




書目名稱Computer Algebra in Scientific Computing網(wǎng)絡公開度學科排名




書目名稱Computer Algebra in Scientific Computing被引頻次




書目名稱Computer Algebra in Scientific Computing被引頻次學科排名




書目名稱Computer Algebra in Scientific Computing年度引用




書目名稱Computer Algebra in Scientific Computing年度引用學科排名




書目名稱Computer Algebra in Scientific Computing讀者反饋




書目名稱Computer Algebra in Scientific Computing讀者反饋學科排名

出來

遍及

Systems and Software Verificationt of Gerdt’s algorithm [.] to construct an involutive basis for the input ideal as well as an involutive basis for the syzygy module of the output basis. Then we apply this new algorithm in the context of Seiler’s method to transform a given ideal into quasi stable position to ensure the existence o

circuit

卡死偷電

Mrugainduta Patil,Pawan K. Dhar Since the topology of the curve near a singular point is not numerically stable, we trace the curve only outside neighborhoods of singular points and replace each neighborhood simply by a point, which produces a polygonal approximation that is .-close to the curve. Such an approximation is more sta

nepotism

nepotism

Identification of Eukaryotic Promotersvectors of . irreducible representations is presented. The effective method resulting in analytical formula of overlap integrals in the case of the non-canonical BM basis [S. Alisauskas, P. Raychev, R. Roussev, J. Phys. G ., 1213 (1981)] is used. A symbolic recursive algorithm for orthonormalisation

fiscal

Systems and Synthetic Immunologyir result that a multilinear polynomial over the finite field of order 2 can be factored in time cubic in the size of the polynomial given as a string. Later, we have rediscovered this result and provided a simple factorization algorithm based on computations over derivatives of multilinear polynomi

Palatial

Romain Laborde,Thierry Despratsal Newton–Puiseux polynomial. A polynomial complexity algorithm for resolubility of a tropical curve is designed. The complexity of resolubility of tropical prevarieties of arbitrary codimensions is studied.

Detain

Fran?ois Gagnon,Tomas Dej,Babak Esfandiariude a criterion and an algorithm, deciding whether a tropical linear . is a tropical linear . formulated in terms of a duality between . and .. We give an example of a countable family of tropical hyperplanes such that their intersection is not a tropical prevariety.