787 search results - page 116 / 158 » Polynomial Constants are Decidable |
131
Voted
AI
2011
Springer
14 years 11 months ago
2011
Springer
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
190
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
177
click to vote
ICDT
2011
ACM
14 years 7 months ago
2011
ACM
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
142
click to vote
IACR
2011
14 years 3 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
146
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...