MINISTRY OF EDUCATION AND SCIENCE OF THE REPUBLIC OF KAZAKHSTAN COMMITTEE OF SCIENCE INSTITUTE OF INFORMATION AND COMPUTATIONAL TECHNOLOGIES Information Security Laboratory

First Page		Document Content
Date: 2016-06-10 06:36:00 Algebra Mathematics Polynomials Computer algebra Abstract algebra Irreducible polynomial Polynomial Finite fields Polynomial decomposition Finite field arithmetic		MINISTRY OF EDUCATION AND SCIENCE OF THE REPUBLIC OF KAZAKHSTAN COMMITTEE OF SCIENCE INSTITUTE OF INFORMATION AND COMPUTATIONAL TECHNOLOGIES Information Security Laboratory Add to Reading List Source URL: ctcrypt.ru Download Document from Source Website File Size: 378,21 KB Share Document on Facebook

	Primary decomposition of zero-dimensional ideals: Putting Monico’s algorithm into practice extended abstract † DocID: 1r2Hp - View Document
	Parallel Iterative Refinement in Polynomial Eigenvalue Problems∗ Carmen Campos Jose E. Roman DocID: 1qwsT - View Document
	On the existence of equiangular tight frames M´aty´as A. Sustik Dept. of Computer Sciences, The University of Texas, Austin, TX 78712 DocID: 1qeEM - View Document
	MINISTRY OF EDUCATION AND SCIENCE OF THE REPUBLIC OF KAZAKHSTAN COMMITTEE OF SCIENCE INSTITUTE OF INFORMATION AND COMPUTATIONAL TECHNOLOGIES Information Security Laboratory DocID: 1qcOI - View Document
	Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth Markus Bl¨aser and Christian Hoffmann Saarland University, Germany Abstract. We consider the multivariate interlace polynomial introduced by Courc DocID: 1q2CQ - View Document