557 search results - page 17 / 112 » A Type-Coercion Problem in Computer Algebra |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
AISC
2008
Springer
13 years 9 months ago
2008
Springer
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
JACM
2010
13 years 6 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
SIAMDM
2010
13 years 6 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
AFPAC
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. In this paper we investigate the Lie model of Lie sphere geometry using Clifford algebra. We employ it to Euclidean geometric problems involving oriented contact to simpl...