5608 search results - page 57 / 1122 » On the Theory of Matchgate Computations |
123
click to vote
FOCS
2010
IEEE
14 years 11 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
106
click to vote
PODS
2012
ACM
13 years 3 months ago
2012
ACM
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
109
click to vote
ATAL
2011
Springer
14 years 1 months ago
2011
Springer
Computational models of motivation are tools that artificial agents can use to autonomously identify, prioritize, and select the goals they will pursue. Previous research has focu...
139
click to vote
IACR
2011
14 years 1 months ago
2011
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
103
click to vote
IJAC
2002
15 years 1 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...