Sciweavers

3443 search results - page 1 / 689
» More Algebras for Determiners
Sort
View
LACL
2005
Springer
13 years 11 months ago
More Algebras for Determiners
Abstract. Some new algebras, which are possible denotations for various determiners, are studied. One of them is the algebra of generalised cardinal quantifiers which is a sub-alg...
Richard Zuber
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
13 years 11 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
LICS
2000
IEEE
13 years 9 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
HASE
2008
IEEE
13 years 12 months ago
Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination
For complex services, logging is an integral part of many middleware aspects, especially, transactions and monitoring. In the event of a failure, the log allows us to deduce the c...
Debmalya Biswas, Thomas Gazagnaire, Blaise Genest
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 2 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan