544 search results - page 12 / 109 » The Algebra of Equality Proofs |
CSL
2010
Springer
13 years 9 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. Thi...
MLQ
2006
13 years 7 months ago
2006
We show that a Woodin cardinal is necessary for the Extender Algebra to be complete. Our proof is relatively simple and does not use fine structure.
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
COMBINATORICS
2007
13 years 8 months ago
2007
In this paper, we study the simple eigenvectors of two hypomorphic matrices using linear algebra. We also give new proofs of results of Godsil and McKay.