Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 8th International Co Shojiro Sakata Conference proceedings 1991 Springer-

水平

書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)學(xué)科排名




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網(wǎng)絡(luò)公開度




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次學(xué)科排名




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用學(xué)科排名




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋學(xué)科排名

溫和女孩

Single exponential path finding in semialgebraic sets Part I: The case of a regular bounded hypersumialgebraic path of V connecting x. and x.. By the way the algorithm constructs a roadmap of V. In particular we obtain that the number of semialgebraically connected components of V is computable within the mentioned time bounds.

先鋒派

insecticide

FLAG

Harold Umberger,Adrian Gheorghemialgebraic path of V connecting x. and x.. By the way the algorithm constructs a roadmap of V. In particular we obtain that the number of semialgebraically connected components of V is computable within the mentioned time bounds.

Engaging

知識分子

https://doi.org/10.1007/978-3-642-05320-7st asymmetric errors, and codes correcting random and burst asymmetric errors. Furthermore, more efficient .-ary burst-asymmetric-error-correcting codes are presented. When .=2, these codes have approximately .+log..+1/2 log. log.. check bits.

evasive

Aspirin

Error-coded algorithms for on-line arithmetic,rected error at the j-th step leads to restriction of precision in the remaining steps but not to a catastrophic termination of the computation. The code-preserving algorithms are developed and their performance and effectiveness evaluated. Two particular schemes based on residue and AN encoding are discussed.

GEAR