Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech

First Page		Document Content
Date: 2008-08-04 00:47:22 Computer algebra Computational complexity theory Polynomials Algebra Factorization of polynomials Polynomial Time complexity Reduction Polynomial greatest common divisor Factorization of polynomials over finite fields		Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech Add to Reading List Source URL: users.cms.caltech.edu Download Document from Source Website File Size: 244,44 KB Share Document on Facebook

	TOWARDS A SOCIOLOGY OF HARM REDUCTION: A COMPARATIVE STUDY OF DRUG POLICY CHANGE IN CANADA AND THE UNITED KINGDOM BETWEEN THE YEARS 1985 AND 2017 by DocID: 1xVT2 - View Document
	IEEE TRANSACTIONS ON COMPUTERS, VOL. ??, NO. ??, ??? A New Range-Reduction Algorithm N. Brisebarre, D. Defour, P. Kornerup, J.-M Muller and N. Revol DocID: 1xVRx - View Document
	Language-level Symmetry Reduction for Probabilistic Model Checking Alastair F. Donaldson Alice Miller David Parker Computing Laboratory Department of Computing Science DocID: 1xVun - View Document
	Approximate Partial Order Reduction? Chuchu Fan, Zhenqi Huang, and Sayan Mitra University of Illinois at Urbana-Champaign, ECE Department {cfan10, zhuang25, mitras}@illinois.edu Abstract. We present a new partial order DocID: 1xVg7 - View Document
	Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices Shi Bai1 , Damien Stehl´e1 and Weiqiang Wen1 1 DocID: 1xUq5 - View Document