Seller: WeBuyBooks, Rossendale, LANCS, United Kingdom
Condition: 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.
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 152.
Language: English
Published by Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo ; Hong Kong ; Barcelona ; Budapest : Springer, 1992
ISBN 10: 3540553088 ISBN 13: 9783540553083
Seller: Antiquariat Bookfarm, Löbnitz, Germany
VII, 142 pages Ex-Library book in good condition. 9783540553083 Sprache: Englisch Gewicht in Gramm: 440.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Language: English
Published by Springer Berlin Heidelberg, 1992
ISBN 10: 3540553088 ISBN 13: 9783540553083
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - From Gauss to G|del, mathematicians have sought an efficientalgorithm to distinguish prime numbers from compositenumbers. This book presents a random polynomial timealgorithm for the problem. The methods used are fromarithmetic algebraic geometry, algebraic number theory andanalyticnumber theory. In particular, the theory of twodimensional Abelian varieties over finite fields isdeveloped.The book will be of interest to both researchers andgraduate students in number theory and theoretical computerscience.
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, Ithaca, NY in May 1994.The 35 papers accepted for inclusion in this book address many current issues of algorithmic, computational and complexity-theoretic aspects of number theory and thus report the state-of-the-art in this exciting area of research; the book also contributes essentially to foundational research in cryptology and coding.Of particular value is a collection entitled 'Open Problems in Number Theoretic Complexity, II' contributed by Len Adleman and Kevin McCurley. This survey presents on 32 pages 36 central open problems and relates them to the literature by means of some 160 references.
Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | From Gauss to G|del, mathematicians have sought an efficientalgorithm to distinguish prime numbers from compositenumbers. This book presents a random polynomial timealgorithm for the problem. The methods used are fromarithmetic algebraic geometry, algebraic number theory andanalyticnumber theory. In particular, the theory of twodimensional Abelian varieties over finite fields isdeveloped.The book will be of interest to both researchers andgraduate students in number theory and theoretical computerscience.
Taschenbuch. Condition: Neu. Algorithmic Number Theory | First International Symposium, ANTS-I, Ithaca, NY, USA, May 6 - 9, 1994. Proceedings | Leonard M. Adleman (u. a.) | Taschenbuch | x | Englisch | 1994 | Springer | EAN 9783540586913 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 152 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 152.
Language: English
Published by Springer Berlin Heidelberg, 1992
ISBN 10: 3540553088 ISBN 13: 9783540553083
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. From Gauss to G|del, mathematicians have sought an efficientalgorithm to distinguish prime numbers from compositenumbers. This book presents a random polynomial timealgorithm for the problem. The methods used are fromarithmetic algebraic geometr.
Language: English
Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Apr 1992, 1992
ISBN 10: 3540553088 ISBN 13: 9783540553083
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -From Gauss to G|del, mathematicians have sought an efficientalgorithm to distinguish prime numbers from compositenumbers. This book presents a random polynomial timealgorithm for the problem. The methods used are fromarithmetic algebraic geometry, algebraic number theory andanalyticnumber theory. In particular, the theory of twodimensional Abelian varieties over finite fields isdeveloped.The book will be of interest to both researchers andgraduate students in number theory and theoretical computerscience.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 152 pp. Englisch.
Language: English
Published by Springer Berlin Heidelberg Nov 1994, 1994
ISBN 10: 3540586911 ISBN 13: 9783540586913
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, Ithaca, NY in May 1994.The 35 papers accepted for inclusion in this book address many current issues of algorithmic, computational and complexity-theoretic aspects of number theory and thus report the state-of-the-art in this exciting area of research; the book also contributes essentially to foundational research in cryptology and coding.Of particular value is a collection entitled 'Open Problems in Number Theoretic Complexity, II' contributed by Len Adleman and Kevin McCurley. This survey presents on 32 pages 36 central open problems and relates them to the literature by means of some 160 references. 340 pp. Englisch.
Language: English
Published by Springer Berlin Heidelberg, 1994
ISBN 10: 3540586911 ISBN 13: 9783540586913
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, Ithaca, NY in May 1994.The 35 papers accepted for inclusion in this book address many current issues of algorithmic, comp.
Language: English
Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 1994, 1994
ISBN 10: 3540586911 ISBN 13: 9783540586913
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, Ithaca, NY in May 1994.The 35 papers accepted for inclusion in this book address many current issues of algorithmic, computational and complexity-theoretic aspects of number theory and thus report the state-of-the-art in this exciting area of research; the book also contributes essentially to foundational research in cryptology and coding.Of particular value is a collection entitled 'Open Problems in Number Theoretic Complexity, II' contributed by Len Adleman and Kevin McCurley. This survey presents on 32 pages 36 central open problems and relates them to the literature by means of some 160 references.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 340 pp. Englisch.