日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

報告書

A Generalized and improved constructive separation bound for real algebraic expressions

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45391

Schirra,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
There are no locators available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)

MPI-I-2000-1-004.pdf
(全文テキスト(全般)), 15MB

付随資料 (公開)
There is no public supplementary material available
引用

Mehlhorn, K., & Schirra, S.(2000). A Generalized and improved constructive separation bound for real algebraic expressions (MPI-I-2000-1-004). Saarbrücken: Max-Planck-Institut für Informatik.


引用: https://hdl.handle.net/11858/00-001M-0000-0014-6D56-E
要旨
We prove a separation bound for a large class of algebraic expressions specified by expression dags. The bound applies to expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, $k$-th root operations for integral $k$, and taking roots of polynomials whose coefficients are given by the values of subexpressions. The (logarithm of the) new bound depends linearly on the algebraic degree of the expression. Previous bounds applied to a smaller class of expressions and did not guarantee linear dependency. \ignore{In~\cite{BFMS} the dependency was quadratic. and in the Li-Yap bound~\cite{LY} the dependency is usually linear, but may be even worse than quadratic.}