5608 search results - page 1010 / 1122 » On the Theory of Matchgate Computations |
STOC
2007
ACM
16 years 1 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
119
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
STOC
2004
ACM
16 years 1 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
121
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
199
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...