557 search results - page 14 / 112 » A Type-Coercion Problem in Computer Algebra |
CP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
IJCGA
2006
13 years 7 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
PR
2002
13 years 7 months ago
2002
A fuzzy point is a region representing the uncertain location of a normal Euclidean point. A fuzzy point in the plane is considered to be a closed disk (a circle and its interior)...
ICCS
2004
Springer
14 years 28 days ago
2004
Springer
The DisCAS system employs and interacts with multiple ELIMINOs distributed over the Internet to achieve a distributed-parallel computing environment. ELIMINO is a computer algebra ...
TCOS
2010
13 years 2 months ago
2010
Abstract. In [24] Raddum and Semaev propose a technique to solve systems of polynomial equations over F2 as occurring in algebraic attacks on block ciphers. This approach is known ...