On the Complexity of Computing Units in a Number Field V. Arvind and Piyush P Kurur Institute of Mathematical Sciences C.I.T Campus,Chennai, India {arvind,ppk - Muntinlupa Science High School - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2016-07-30 09:35:21 Complexity classes Algebraic number theory Polynomials Circuit complexity NC NP Lattice Algebraic number field Jordan normal form Discriminant of an algebraic number field		On the Complexity of Computing Units in a Number Field V. Arvind and Piyush P Kurur Institute of Mathematical Sciences C.I.T Campus,Chennai, India {arvind,ppk}@imsc.res.in Add to Reading List Source URL: www.cse.iitk.ac.in Download Document from Source Website File Size: 380,99 KB Share Document on Facebook

	CLASS FIELD THEORY P. Stevenhagen Explicit Algebraic Number Theory Oberwolfach Seminar November 2002 DocID: 1voYb - View Document
	Advanced algebraic number theory Advanced algebraic number theory A. Page IMB INRIA/Université de Bordeaux DocID: 1vmt5 - View Document
	MATH 205 (TOPICS IN ALGEBRAIC NUMBER THEORY) - SPRINGProfessor: Cristian D. Popescu Course Topic: Global Fields Course Description: The main goal of this course is to understand global fields (finite field extensi DocID: 1uKaO - View Document
	Algebraic Number Theory (PARI-GP versionBinary Quadratic Forms 2 create ax2 + bxy DocID: 1uHHs - View Document
	ELLIPTIC CURVES AND IWASAWA’S µ = 0 CONJECTURE R. SUJATHA To Parimala on the occasion of her sixtieth birthday 1. Introduction A fundamental problem in algebraic number theory concerns the study of the absolute DocID: 1uAwD - View Document