CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Polynomial irreducibility testing through Minkowski summand computation Deepanjan Kesh and Shashank K Mehta∗ Abstract

First Page		Document Content
Date: 2008-10-29 00:08:09 Linear programming Abstract polytope Polyhedral combinatorics Geometry Polytopes Convex polytope		CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Polynomial irreducibility testing through Minkowski summand computation Deepanjan Kesh and Shashank K Mehta∗ Abstract Add to Reading List Source URL: cccg.ca Download Document from Source Website File Size: 170,56 KB Share Document on Facebook