The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper provides a fast algorithm for Gröbner bases of homogenous ideals of the ring over a field . The computational complexity of the algorithm is O(N2), where N is the maximum degree of the input generating polynomials. The new algorithm can be used to solve a problem of blind recognition of convolutional codes. This is a new generalization of the important...
This paper provides a fast algorithm for Gröbner bases of homogenous ideals of $$ \mathbb{F} $$ [x, y] over a finite field $$ \mathbb{F} $$ . We show that only the S-polynomials of neighbor pairs of a strictly ordered finite homogenours generating set are needed in the computing of a Gröbner base of the homogenous ideal. It reduces dramatically the number of unnecessary S-polynomials that...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.