<--- Back to Details
First PageDocument Content
Mathematics / Abstract algebra / Mathematical analysis / Algebraic number theory / Discriminant of an algebraic number field / Riemann hypothesis / Algebraic number field / Table of stars with Bayer designations / Computational complexity of mathematical operations
Date: 2014-09-02 16:26:26
Mathematics
Abstract algebra
Mathematical analysis
Algebraic number theory
Discriminant of an algebraic number field
Riemann hypothesis
Algebraic number field
Table of stars with Bayer designations
Computational complexity of mathematical operations

MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000–000 SXXAN L(1/3) ALGORITHM FOR IDEAL CLASS GROUP AND REGULATOR COMPUTATION IN CERTAIN NUMBER FIELDS

Add to Reading List

Source URL: www.lix.polytechnique.fr

Download Document from Source Website

File Size: 311,57 KB

Share Document on Facebook

Similar Documents

VIRGINIA SPACE GRANT - STUDENT RESEARCH CONFERENCEValidation Framework for Multiprocessor and Distributed Scheduling Algorithms

VIRGINIA SPACE GRANT - STUDENT RESEARCH CONFERENCEValidation Framework for Multiprocessor and Distributed Scheduling Algorithms

DocID: 1r8nr - View Document

COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used

COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used

DocID: 1r5tA - View Document

CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

DocID: 1r5hV - View Document

Efficient Optimization of Many Objectives by Approximation-Guided Evolution Markus Wagnerc,∗, Karl Bringmanna , Tobias Friedrichb , Frank Neumannc a  Max-Planck-Institut f¨

Efficient Optimization of Many Objectives by Approximation-Guided Evolution Markus Wagnerc,∗, Karl Bringmanna , Tobias Friedrichb , Frank Neumannc a Max-Planck-Institut f¨

DocID: 1r3J2 - View Document

Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1

Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1

DocID: 1qWKb - View Document