Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=948

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Supports of a code
L.A. Bassalygo
Lecture Notes in Computer Science 948, 1995, pp. 1-3
Chemical isomerism, a challenge for algebraic combinatorics and for computer science
Ch. Benecke, R. Grund, R. Hohberger, A. Kerber, R. Laue, T. Wieland
Lecture Notes in Computer Science 948, 1995, pp. 4-20
On algebraic methods in covering radius problems
I. Honkala, S. Litsyn, A. Tietäväinen
Lecture Notes in Computer Science 948, 1995, pp. 21-32
How lower and upper complexity bounds meet in elimination theory
Luis M. Pardo
Lecture Notes in Computer Science 948, 1995, pp. 33-69
Bivariate polynomial multiplication patterns
Arnold Schönhage
Lecture Notes in Computer Science 948, 1995, pp. 70-81
Division of entire functions by polynomial ideals
J. Apel
Lecture Notes in Computer Science 948, 1995, pp. 82-95
Variations on minimal codewords in linear codes
A. Ashikhmin, A. Barg, G. Cohen, L. Huguet
Lecture Notes in Computer Science 948, 1995, pp. 96-105
On the computation of the radical of polynomial complete intersection ideals
Inés Armendáriz, Pablo Solernó
Lecture Notes in Computer Science 948, 1995, pp. 106-119
Which families of long binary linear codes have a binomial weight distribution?
Th. Beth, H. Kalouti, D.E. Lazic
Lecture Notes in Computer Science 948, 1995, pp. 120-130
The discovery of simple 7-designs with automorphism group P \Gamma L(2,32)
Anton Betten, Adalbert Kerber, Axel Kohnert, Reinhard Laue, Alfred Wassermann
Lecture Notes in Computer Science 948, 1995, pp. 131-145
Fast exponentation in cryptography
Irina E. Bocharova, Boris D. Kudryashov
Lecture Notes in Computer Science 948, 1995, pp. 146-157
On maximal spherical codes I
Peter Boyvalenkov, Ivan Landgev
Lecture Notes in Computer Science 948, 1995, pp. 158-168
Formal computation of Galois groups with relative resolvents
Antoine Colin
Lecture Notes in Computer Science 948, 1995, pp. 169-182
A case of automatic theorem proving in Euclidean geometry: The Maclane 8_3 theorem
Pasqualina Conti, Carlo Traverso
Lecture Notes in Computer Science 948, 1995, pp. 183-193
Isometry classes of indecomposable linear codes
Harald Fripertinger, Adalbert Kerber
Lecture Notes in Computer Science 948, 1995, pp. 194-204
When polynomial equation systems can be "solved" fast?
M. Giusti, J. Heintz, J.E. Morais, L.M. Pardo
Lecture Notes in Computer Science 948, 1995, pp. 205-231
Using symmetric functions to describe the solution set of a zero dimensional ideal
Laureano González-Vega, Guadelupe Trujillo
Lecture Notes in Computer Science 948, 1995, pp. 232-247
Triangular systems and factorized Gröbner bases
Hans-Gert Gräbe
Lecture Notes in Computer Science 948, 1995, pp. 248-261
Computation in algebraic function fields for effective construction of algebraic-geometric codes
Gaétan Haché
Lecture Notes in Computer Science 948, 1995, pp. 262-278
Singly-even self-dual codes and Hadamard matrices
Masaaki Harada, Vladimir D. Tonchev
Lecture Notes in Computer Science 948, 1995, pp. 279-284
Implicitization of curves parameterized by generalized trigonometric polynomials
Hoon Hong
Lecture Notes in Computer Science 948, 1995, pp. 285-296
Randomness properties of partial \gamma -\beta planes as LSI test inputs and their implementations
Yukihiro Kamiya, Takayuki Miki, Yosihiro Iwadare
Lecture Notes in Computer Science 948, 1995, pp. 297-311
Mixed covering codes with two binary and four ternary coordinates
E. Kolev
Lecture Notes in Computer Science 948, 1995, pp. 312-322
About approximations of exponentials
P.-V. Koseleff
Lecture Notes in Computer Science 948, 1995, pp. 323-333
A note on normal bases
J. Lacan, E. Delpeyroux
Lecture Notes in Computer Science 948, 1995, pp. 334-340

Seiten 1 2 >