39 search results - page 6 / 8 » On the Diameter of Lattice Polytopes |
CCCG
2008
15 years 1 months ago
2008
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking. Our algorithms achieve a running times o...
CC
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents a new method for computing the integer hull of a parameterized rational polyhedron by introducing the concept of periodic polyhedron. Besides concerning general...
102
click to vote
CP
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
EJC
2002
14 years 11 months ago
2002
Given a Newtonian coalgebra we associate to it a chain complex. The homology groups of this Newtonian chain complex are computed for two important Newtonian coalgebras arising in ...