Sciweavers

2042 search results - page 125 / 409
» Variable Number of
Sort
View
CP
2000
Springer
15 years 8 months ago
Algebraic Simplification Techniques for Propositional Satisfiability
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...
João P. Marques Silva
CCCG
2008
15 years 5 months ago
Polynomial irreducibility testing through Minkowski summand computation
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...
Deepanjan Kesh, Shashank K. Mehta
DAM
2010
120views more  DAM 2010»
15 years 4 months ago
A new approximation algorithm for the multilevel facility location problem
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
APAL
2004
84views more  APAL 2004»
15 years 4 months ago
Finite, integral, and finite-dimensional relation algebras: a brief history
Relation were invented by Tarski and his collaborators in the middle of the twentieth century. The concept of integrality arose naturally early in the history of the subject, and s...
Roger D. Maddux
MOC
2002
87views more  MOC 2002»
15 years 4 months ago
Finite SAGBI bases for polynomial invariants of conjugates of alternating groups
It is well-known, that the ring C[X1, . . . , Xn]An of polynomial invariants of the alternating group An has no finite SAGBI basis with respect to the lexicographical order for any...
Manfred Göbel