89 search results - page 1 / 18 » Effective Set Membership in Computer Algebra and Beyond |
AISC
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. In previous work, we showed the importance of distinguishing "I know that X = Y " from "I don't know that X = Y ". In this paper we look at effec...
RELMICS
2009
Springer
13 years 11 months ago
2009
Springer
Using relation algebra, we generalize Aumann’s notion of a contact relation and that of a closure operation from powersets to general membership relations and their induced parti...
IJAC
2002
13 years 4 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
CSR
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
Abstract— In this paper we consider the issue of network capacity. The recent work by Li and Yeung examined the network capacity of multicast networks and related capacity to cut...