Idioma: Inglés
Publicado por Kluwer Academic Publishers, 1992
ISBN 10: 0792320573 ISBN 13: 9780792320579
Librería: WeBuyBooks, Rossendale, LANCS, Reino Unido
EUR 63,60
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned. Ex library copy with usual stamps & stickers.
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
EUR 65,60
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 118,54
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 107,72
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 133,05
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, US, 1992
ISBN 10: 0792320573 ISBN 13: 9780792320579
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 135,40
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other areas of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc). The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presupposes only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 120,26
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 153,15
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 1st edition. 256 pages. 10.00x6.75x0.75 inches. In Stock.
EUR 119,32
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive .
Idioma: Inglés
Publicado por Kluwer Academic Publishers, US, 1992
ISBN 10: 0792320573 ISBN 13: 9780792320579
Librería: Rarewaves.com UK, London, Reino Unido
EUR 128,07
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other areas of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc). The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presupposes only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.
EUR 160,91
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other araes of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc.) The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presuppose only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, 1992
ISBN 10: 0792320573 ISBN 13: 9780792320579
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 127,91
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Idioma: Inglés
Publicado por SPRINGER NATURE Nov 1992, 1992
ISBN 10: 0792320573 ISBN 13: 9780792320579
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 221,49
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other araes of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc.) The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presuppose only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields. 256 pp. Englisch.