default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDApplicable Algebra in Engineering, Communication and Computing, Volume 7
Volume 7, Number 1, 1995
- Patrizia M. Gianni, Barry M. Trager:
Square-free algorithms in positive characteristic. 1-14 - W. M. Chu:
Construction of irreducible polynomials using cubic transformation. 15-19 - Wolfram Koepf:
Closed form Laurent-Puiseux series of algebraic functions. 21-26 - Michele Elia:
Are fifth-degree equations over GF(5m) solvable by radicals? 27-40 - José Luis Montaña
, Jose Enrique Morais, Luis Miguel Pardo:
Lower bounds for arithmetic networks II: Sum of Betti numbers. 41-51 - Helmer Aslaksen, Shih-Ping Chan, Tor Gulliksen:
Invariants ofS4 and the shape of sets of vectors. 53-57 - Henning Fernau:
Valuations, regular expressions, and fractal geometry. 59-75
Volume 7, Number 2, 1996
- Michael F. Singer:
Testing reducibility of linear differential operators: A group theoretic perspective. 77-104 - Karin Gatermann:
Semi-Invariants, equivariants and algorithms. 105-124 - Ralph-Hardo Schulz:
Check character systems over groups and orthogonal Latin squares. 125-132 - Maria C. F. Ferreira, Hans Zantema:
Total termination of term rewriting. 133-162
Volume 7, Number 3, 1996
- Toshiaki Shoji:
On the computation of unipotent characters of finite classical groups. 165-174 - Meinolf Geck, Gerhard Hiss, Frank Lübeck, Gunter Malle, Götz Pfeiffer:
CHEVIE - A system for computing and processing generic character tables. 175-210 - Fokko du Cloux:
The state of the art in the computation of Kazhdan-Lusztig polynomials. 211-219 - Peter Fleischmann, Ingo Janiszczak:
On the computation of conjugacy classes of Chevalley groups. 221-234 - Hubert Grassmann, Gert-Martin Greuel, Bernd Martin, Wolfgang Neumann, Gerhard Pfister, Wilfred Pohl, Hans Schönemann, Thomas Siebert:
On the Implementation of Standard Bases and Syzygies in SINGULAR. 235-249
Volume 7, Number 4, 1996
- Christoph Hering:
On the Diophantine equations ax2 + bx + c = c0 c1y1 1/4cryr . 251-262 - Dominique Guillaume, François Morain:
Building pseudoprimes with a large number of prime factors. 263-277 - Serge G. Vladut:
Two applications of Weil-Serre's explicit formula. 279-288 - Eric Bach:
Weil bounds for singular curves. 289-298 - Alexei E. Ashikhmin, Simon Litsyn:
Fast decoding of non-binary first order Reed-Muller codes. 299-308 - Franz Baader, Werner Nutt:
Combination problems for commutative/monoidal theories or how algebra can help in equational unification. 309-337
Volume 7, Number 5, 1996
- Willem A. de Graaf, Gábor Ivanyos, Lajos Rónyai:
Computing Cartan subalgebras of Lie algebras. 339-349 - Yagati N. Lakshman, B. David Saunders:
Sparse shifts for univariate polynomials. 351-364 - Stéphane Collart, Daniel Mall:
A combinatorial result on Gröbner Fans with an application to universal Gröbner bases. 365-375 - Joachim Althaler, Arne Dür:
Finite linear recurring sequences and homogeneous ideals. 377-390 - Torsten Minkwitz:
Extensions of irreducible representations. 391-399 - Zena M. Ariola:
Relating graph and term rewriting via Böhm models. 401-426
Volume 7, Number 6, 1996
- Igor E. Shparlinski:
On irreducible polynomials of small height over finite fields. 427-431 - Alexander Barg:
Two families of low-correlated binary sequences. 433-437 - Feodor S. Vainstein:
Low redundancy polynomial checks for numerical computation. 439-447 - Sebastian Egner:
Semi-numerical solution to 6/6-Stewart-platform kinematics based on symmetry. 449-468 - Alfons Geser:
An Improved General Path Order. 469-511
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 2025-12-04 01:27 CET 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:
