3443 search results - page 55 / 689 » More Algebras for Determiners |
SIAMSC
2010
13 years 6 months ago
2010
Abstract. Several innovative random-sampling and random-mixing techniques for solving problems in linear algebra have been proposed in the last decade, but they have not yet made a...
LFCS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce and illustrate a graph calculus for proving and deciding the positive identities and inclusions of fork algebras, i.e., those without occurrences of complementation. ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Usually creative telescoping is used to derive recurrences for sums. In this article we show that the non-existence of a creative telescoping solution, and more generally, of a par...
SIGMOD
2002
ACM
13 years 7 months ago
2002
ACM
A variety of developments combine to highlight the need for respecting order when manipulating relations. For example, new functionality is being added to SQL to support OLAP-styl...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...