IMSC - PDFSEARCH.IO - Document Search Engine

IMSC
Results: 679

#	Item
81	Munsang College (Hong Kong Island) School Calendar[removed]First Semester December Add to Reading List Source URL: www.imsc.edu.hk Language: English - Date: 2014-08-24 13:37:54 Events at the 2006 Commonwealth Games Indian Railways Rail transport in India Matt Finish Chronology
82	PDF Document Add to Reading List Source URL: www.imsc.edu.hk - Date: 2012-12-02 20:35:12
83	PDF Document Add to Reading List Source URL: www.imsc.edu.hk - Date: 2015-01-11 20:07:15
84	PDF Document Add to Reading List Source URL: www.imsc.edu.hk - Date: 2014-10-30 23:09:15
85	PDF Document Add to Reading List Source URL: www.imsc.edu.hk - Date: 2014-10-30 23:08:42
86	PDF Document Add to Reading List Source URL: www.imsc.edu.hk - Date: 2014-10-30 23:08:06
87	Euclid’s Algorithm In this lecture, we study the algebraic complexity of the classic Euclid’s algorithm for polynomials, and the asymptotically fast half-gcd approach. This lecture is based upon [1, Chap[removed] Add to Reading List Source URL: www.imsc.res.in Language: English - Date: 2012-01-30 02:26:18 Mathematics Euclidean algorithm
88	Axioms for composite strategies R. Ramanujam and Sunil Simon The Institute of Mathematical Sciences C.I.T. Campus, Chennai[removed], India. E-mail: {jam,sunils}@imsc.res.in Add to Reading List Source URL: www.imsc.res.in Language: English - Date: 2006-08-04 05:49:08 Symbol Structure Interpretation Constructible universe Metaphilosophy Orbifold Model theory Logic Mathematics
89	A (restricted) quantifier elimination for security protocols ? R. Ramanujam ∗ The Institute of Mathematical Sciences, C.I.T. Campus, Taramani, Chennai[removed], India S.P. Suresh Add to Reading List Source URL: www.imsc.res.in Language: English - Date: 2006-08-04 05:49:00 Burrows–Abadi–Needham logic Needham–Schroeder protocol Communications protocol Model theory Quantifier elimination Security protocol notation Cryptographic protocols Data Information
90	Euclid’s Algorithm over Rings – The Theory of Subresultants Euclid’s algorithm, as described in the previous lecture, works well when the coefficients of the input polynomials A, B, belong to a field F . There are Add to Reading List Source URL: www.imsc.res.in Language: English - Date: 2012-02-09 06:04:53 Mathematics Euclidean algorithm Polynomial ring Polynomial Computer algebra Abstract algebra Algebra Polynomials

UPDATE