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

First Page	Meta Content
	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 Document Date: 2008-10-29 00:08:09 Open Document File Size: 170,56 KB Share Result on Facebook City Kanpur / / Company The times / / Currency pence / / / Facility University Lecture Series / / IndustryTerm trivial solution / pseudo-polynomial time algorithm / decomposition algorithms / randomized heuristic algorithm / / NaturalFeature D. Mount / / OperatingSystem GNU / / Organization American Mathematical Society / Department of Computer Science and Engineering / / Person Reinhard Diestel / Bernd Sturmfels Gr / / Position VP / VP / EP / / ProgrammingLanguage C / / Technology decomposition algorithms / RAM / pseudo-polynomial time algorithm / 4 processor / randomized heuristic algorithm / / URL http / SocialTag 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∗ AbstractAdd to Reading List