Irreducibility - PDFSEARCH.IO - Document Search Engine

Irreducibility
Results: 152

#	Item
31	Approximating the average stretch factor of geometric graphs∗ Siu-Wing Cheng† Christian Knauer‡ Stefan Langerman§ Michiel Smid¶ Abstract Let G be a geometric graph whose vertex set S is a set of n points in Rd . Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2011-01-03 00:53:54 Finite fields Computational geometry Matroid theory Tutte polynomial Factorization of polynomials over a finite field and irreducibility tests Mathematics Polynomials Elliptic curves
32	Direct Division in Factor Rings Christopher Wolf∗ Department of Mathematics ESAT-COSIC Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2004-12-18 15:04:16 Finite fields Polynomials Euclidean algorithm Greatest common divisor XTR Vehicle Identification Number Factorization of polynomials over a finite field and irreducibility tests Lenstra elliptic curve factorization Mathematics Number theory Algebra
33	HMC MATHEMATICS Sample Math Major for Students Studying Abroad in the Fall of Junior Year Fall Spring Add to Reading List Source URL: www.math.hmc.edu Language: English - Date: 2003-11-14 20:40:39 Mathematics education 11 Logic Mathematical logic Coding theory Finite fields Propositional calculus Factorization of polynomials over a finite field and irreducibility tests Mathematics Harvard University Math 55
34	PRIME SPECIALIZATION IN GENUS 0 BRIAN CONRAD, KEITH CONRAD, AND ROBERT GROSS Abstract. For a prime polynomial f (T ) ∈ Z[T ], a classical conjecture predicts how often f has prime values. For a finite field κ and a pr Add to Reading List Source URL: www.math.uconn.edu Language: English - Date: 2006-05-31 00:00:20 Abstract algebra Finite field Bateman–Horn conjecture Degree of a continuous mapping Degree of a polynomial Resultant Factorization of polynomials over a finite field and irreducibility tests Separable extension Mathematics Algebra Polynomials
35	Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010 Abstract Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-06-09 14:57:08 Finite fields Computability theory Cryptographic protocols Computational complexity theory Diffie–Hellman problem XTR Random self-reducibility Oracle machine Reduction Theoretical computer science Applied mathematics Mathematics
36	CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 26 May 2011 This question paper has 6 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10 Add to Reading List Source URL: www.cmi.ac.in Language: English - Date: 2012-02-26 19:38:35 Μ operator Mathematics Function Factorization of polynomials over a finite field and irreducibility tests
37	Maejo Int. J. Sci. Technol. 2015, 9(01), Maejo International Journal of Science and Technology ISSNAvailable online at www.mijst.mju.ac.th Add to Reading List Source URL: www.mijst.mju.ac.th Language: English - Date: 2015-03-18 22:28:28 Derivative Differential calculus Lipschitz continuity Continuous function Sturm–Liouville theory Factorization of polynomials over a finite field and irreducibility tests Mathematics Mathematical analysis Ordinary differential equations
38	Polynomial irreducibility testing through Minkowski summand computation Deepanjan Kesh and Shashank K Mehta∗ Abstract In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomial Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 23:59:42 Convex polytope Linear programming Duality Tree Graph Abstract polytope Polyhedral combinatorics Geometry Polytopes Mathematics
39	Fast Probabilistic Algorithms for Verification of Polynomial Identities J. T. SCHWARTZ New York Umverszty, New York, New York ABSTRACT T h e starthng success o f the R a b m - S t r a s s e n - S o l o v a y p n m a h t Add to Reading List Source URL: www.multimedialibrary.com Language: English - Date: 2014-03-05 10:08:30 Abstract algebra Resultant Partial fraction Factorization of polynomials over a finite field and irreducibility tests Mathematics Algebra Polynomials
40	Two Improved Range-Eﬃcient Algorithms for F0 Estimation He Sun1,2 and Chung Keung Poon1 1 2 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2007-04-12 14:13:22 Analysis of algorithms Computational complexity theory Time complexity Logarithm Big O notation Streaming algorithm Factorization of polynomials over a finite field and irreducibility tests Euclidean algorithm Theoretical computer science Mathematics Applied mathematics