9842 search results - page 1710 / 1969 » The Complexity of the Matching-Cut Problem |
175
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
138
click to vote
CSCW
2004
ACM
15 years 9 months ago
2004
ACM
Computer system administrators are the unsung heroes of the information age, working behind the scenes to configure, maintain, and troubleshoot the computer infrastructure that un...
127
click to vote
IUI
2004
ACM
15 years 9 months ago
2004
ACM
Technical support procedures are typically very complex. Users often have trouble following printed instructions describing how to perform these procedures, and these instructions...
124
click to vote
CRYPTO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
131
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...