Back to Results
First PageMeta Content
Convex polytope / Linear programming / Duality / Tree / Graph / Abstract polytope / Polyhedral combinatorics / Geometry / Polytopes / Mathematics


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

Document Date: 2008-10-28 23:59:42

Open Document

File Size: 156,07 KB

Share Result on Facebook

City

Kanpur / /

Company

Vertex / 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

VP NP (v) / American Mathematical Society / Department of Computer Science and Engineering / NP (v) / /

Person

Reinhard Diestel / Bernd Sturmfels Gr / /

Position

VP / Prime Minister / VP / EP / /

Product

Pentax K-x Digital Camera / /

ProgrammingLanguage

C / /

PublishedMedium

Pacific Journal Of Mathematics / /

Technology

decomposition algorithms / RAM / pseudo-polynomial time algorithm / 4 processor / randomized heuristic algorithm / /

URL

http /

SocialTag