๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Polynomial time algorithms for sentences over number fields

โœ Scribed by Shih Ping Tung


Book ID
113384013
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
979 KB
Volume
97
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Quantum algorithms for number fields
โœ D. Haase; H. Maier ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 319 KB

## Abstract This is a survey of recent results on quantum algorithms for the computation of invariants of number fields, namely the class number and the regulator. Most known classical algorithms for the computation of these values are of subexponential complexity and depend on the truth of a still