The polynomials f, g E F[Xl, ,X,J are called shift-equivalent if there exists a shift (a~, , cc,) E F" such that f(Xl furl, . . ,X,, + CC,) = g. In three different cases algorithms which produce the set of all shift-equivalences of f, g in polynomial time are designed. Here (1) in the case of a zero
Testing the shift-equivalence of polynomials using quantum machines
β Scribed by D. Grigoriev
- Publisher
- Springer US
- Year
- 1996
- Tongue
- English
- Weight
- 742 KB
- Volume
- 82
- Category
- Article
- ISSN
- 1573-8795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The standard gamble has a firm basis in the theory of risk and, for this reason, is the preferred method of health state value elicitation for many researchers. However, it is widely recognised that the use of immediate death as the failure outcome in the standard gamble renders the met
In this paper we show that the test of Hurwitz property of a segment of polynomials (1! )p (s)# p (s), where 3[0,1], p (s) and p (s) are nth-degree polynomials of real coe$cients, can be achieved via the approach of constructing a fraction-free Routh array and using Sturm's theorem. We also establis