5608 search results - page 368 / 1122 » On the Theory of Matchgate Computations |
197
click to vote
TLCA
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
184
click to vote
ICALP
2004
Springer
16 years 6 days ago
2004
Springer
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
173
click to vote
FOCS
2003
IEEE
16 years 3 days ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
174
click to vote
ISIPTA
2003
IEEE
16 years 3 days ago
2003
IEEE
In this paper we adopt the geometric approach to the theory of evidence to study the geometric counterparts of the plausibility functions, or upper probabilities. The computation ...
181
click to vote
COLT
2003
Springer
16 years 1 days ago
2003
Springer
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...