523 search results - page 94 / 105 » On the Power of Quantum Proofs |
VLDB
2004
ACM
15 years 5 months ago
2004
ACM
We study the fundamental limitations of relational algebra (RA) and SQL in supporting sequence and stream queries, and present effective query language and data model enrichments ...
117
click to vote
AGTIVE
2003
Springer
15 years 5 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
CCS
2003
ACM
15 years 5 months ago
2003
ACM
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
CP
2000
Springer
15 years 3 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
COCO
1991
Springer
15 years 3 months ago
1991
Springer
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...