<--- Back to Details
First PageDocument Content
Mathematics / Algebra / Abstract algebra / Algebraic geometry / Bernhard Riemann / Conjectures / Analysis of algorithms / Analytic number theory / Generalized Riemann hypothesis / Big O notation / Valuation / Riemann hypothesis
Date: 2016-05-19 16:48:45
Mathematics
Algebra
Abstract algebra
Algebraic geometry
Bernhard Riemann
Conjectures
Analysis of algorithms
Analytic number theory
Generalized Riemann hypothesis
Big O notation
Valuation
Riemann hypothesis

Subexponential time relations in the class group of large degree number fields Jean-François Biasse University of Calgary 2500 University Drive NW

Add to Reading List

Source URL: www.lix.polytechnique.fr

Download Document from Source Website

File Size: 469,98 KB

Share Document on Facebook

Similar Documents

A comparison of the Oligomap and TargetScan algorithms for miRNA target analysis Badreddin Edris BIOC 218 Final Project (Win-09) Stanford University Introduction

A comparison of the Oligomap and TargetScan algorithms for miRNA target analysis Badreddin Edris BIOC 218 Final Project (Win-09) Stanford University Introduction

DocID: 1vrBA - View Document

M Zuhair Nashed* (). Concepts of Differentiability in Smooth and Non-smooth Analysis with Applications in Optimization Theory and Algorithms. Preliminary report. In this talk I will pro

M Zuhair Nashed* (). Concepts of Differentiability in Smooth and Non-smooth Analysis with Applications in Optimization Theory and Algorithms. Preliminary report. In this talk I will pro

DocID: 1uZyL - View Document

Experimental Analysis of Receding Horizon Planning Algorithms for Marine Monitoring Soo-Hyun Yoo, Andrew Stuntz, Yawei Zhang, Robert Rothschild, Geoffrey A. Hollinger and Ryan N. Smith  Abstract Autonomous surface vehicl

Experimental Analysis of Receding Horizon Planning Algorithms for Marine Monitoring Soo-Hyun Yoo, Andrew Stuntz, Yawei Zhang, Robert Rothschild, Geoffrey A. Hollinger and Ryan N. Smith Abstract Autonomous surface vehicl

DocID: 1uUAk - View Document

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 19, no. 1, pp. 375–DOI: jgaaSensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 19, no. 1, pp. 375–DOI: jgaaSensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

DocID: 1uSSm - View Document

Analysis of stochastic technical trading algorithms by Markus Höchstötter, Mher Safarian, Anna Krumetsadik  

Analysis of stochastic technical trading algorithms by Markus Höchstötter, Mher Safarian, Anna Krumetsadik 

DocID: 1uS0N - View Document