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 - Terry de la Mesa Allen, Sr. - 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

	Abstract Interpretation over Non-Lattice Abstract Domains Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, and Peter J. Stuckey Department of Computing and Information Systems, The University of Melbour DocID: 1xUNu - View Document
	Recent Progress in Linear Algebra and Lattice Basis Reduction Gilles Villard CNRS, ENS de Lyon, INRIA, UCBL, Université de Lyon Laboratoire LIP DocID: 1xUmT - View Document
	CONTINUED FRACTIONS AND LATTICE SIEVING JENS FRANKE, THORSTEN KLEINJUNG Abstract. We present a new method of lattice sieving which we expect to be faster by a constant factor than the method of Pollard, and which has bee DocID: 1xUb2 - View Document
	Fast Ideal Lattice-Based KEMs on ARM Cortex-M4 Matthias J. Kannwischer, Joost Rijneveld, Peter Schwabe September 03, 2018 DocID: 1xU1Q - View Document
	arXiv:1805.03418v1 [cs.SC] 9 MayComputing an LLL-reduced basis of the orthogonal lattice Jingwei Chen Chongqing Key Lab of Automated Reasoning & Cognition, DocID: 1xU0M - View Document