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影响因子(影响力)学科排名




书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes网络公开度




书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes网络公开度学科排名




书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引频次




书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引频次学科排名




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




书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用学科排名




书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes读者反馈




书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes读者反馈学科排名

温和女孩

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