Library

X
Language
Preferred search index
Number of Hits per Page
Default Sort Criterion
Default Sort Ordering
Size of Search History
Default Email Address
Default Export Format
Default Export Encoding
Facet list arrangement
Maximum number of values per filter
Auto Completion
Feed Format
Maximum Number of Items per Feed
Permalink If you want to be able to use settings permanently, you must save your settings and then set a Bookmark to the permalink
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Square-free algorithms in positive characteristic (1996)
    Springer
    Applicable algebra in engineering, communication and computing 7 (1996), S. 1-14 
    Details
    ISSN: 1432-0622
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract We study the problem of the computation of the square-free decomposition for polynomials over fields of positive characteristic. For fields which are explicitly finitely generated over perfect fields, we show how the classical algorithm for characteristic zero can be generalized using multiple derivations. For more general fields of positive characteristic one must make an additional constructive hypothesis in order for the problem to be decidable. We show that Seidenberg'sCondition P gives a necessary and sufficient condition on the fieldK for computing a complete square free decomposition of polynomials with coefficients in any finite algebraic extension ofK.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01613611
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Square-Free Algorithms in Positive Characteristic (1995)
    Springer
    Applicable algebra in engineering, communication and computing 7 (1995), S. 1-14 
    Details
    ISSN: 1432-0622
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract.  We study the problem of the computation of the square-free decomposition for polynomials over fields of positive characteristic. For fields which are explicitly finitely generated over perfect fields, we show how the classical algorithm for characteristic zero can be generalized using multiple derivations. For more general fields of positive characteristic one must make an additional constructive hypothesis in order for the problem to be decidable. We show that Seidenberg’s Condition P gives a necessary and sufficient condition on the field K for computing a complete square free decomposition of polynomials with coefficients in any finite algebraic extension of K.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01613611
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...