default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDApplicable Algebra in Engineering, Communication and Computing, Volume 1
Volume 1, 1990
- Manuel Bronstein:
A Unification of Liouvillian Extensions. 5-24 - Leandro Caniglia:
How to Compute the Chow Form of an Unmixed Polynomial Ideal in Single Exponential Time. 25-41 - Helmut Meyn:
On the Construction of Irreducible Self-Reciprocal Polynomials Over Finite Fields. 43-53 - Harald Niederreiter:
A Short Proof for Explicit Formulas for Discrete Logarithms in Finite Fields. 55-57 - Rudolf Lidl, Winfried B. Müller, Alan Oswald:
Some Remarks on Strong Fibonacci Pseudoprimes. 59-65 - Johan P. Hansen
, Henning Stichtenoth:
Group Codes on Certain Algebraic Curves with Many Rational Points. 67-77 - Françoise Bellegarde, Pierre Lescanne:
Termination by Completion. 79-96 - Wolfram Büttner, Klaus Estenfeld, Richard Schmid, Hans-Albert Schneider, Erik Tidén:
Symbolic Constraint Handling Through Unification in Finite Algebras. 97-118 - Harald Niederreiter:
An Enumeration Formula for Certain Irreducible Polynomials with an Application to the Construction of Irreducible Polynomials over the Binary Field. 119-124 - Wieb Bosma:
Canonical Bases for Cyclotomic Fields. 125-134 - Erich L. Kaltofen:
Computing the Irreducible Real Factors and Components of an Algebraic Curve. 135-148 - Keith O. Geddes, M. Lawrence Glasser, Reg A. Moore, Tony C. Scott:
Evaluation of Classes of Definite Integrals Involving Elementary Functions via Differentiation of Special Functions. 149-165
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-30 00:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
