1 - 4 of 4 articles
A univariate polynomial over the real or the complex numbers is given approximately. We present a Bayesian method for the computation of the posterior probabilities of different multiplicity patterns. The method is based on interpreting the root computation problem as an inverse problem which is...
An algorithm for computing a Gröbner basis of an ideal of polynomials whose coefficients are taken from a ring with zero divisors, is presented; such rings include
, where n is not a prime number. The algorithm is patterned after (1) Buchberger’s...
The notion of good local behavior of an offset curve was introduced in [2,4] to denote that the behavior of an offset was locally good from a topological point of view. Also, in these papers the problem of checking whether good local behavior holds for a particular offsetting distance, and of...
The practical application of graph prime factorization algorithms is limited in practice by unavoidable noise in the data. A first step towards error-tolerant “approximate” prime factorization, is the development of local approaches that cover the graph by factorizable patches and then use this...
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.