2446 search results - page 150 / 490 » Choiceless Polynomial Time |
82
Voted
IJNSEC
2010
14 years 7 months ago
2010
In this paper we first propose two new concepts concerning the notion of key escrow schemes: provable partiality and independence. Roughly speaking, a scheme has provable partiali...
122
Voted
IWOCA
2010
Springer
14 years 7 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
155
Voted
DISOPT
2011
14 years 4 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
167
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
93
Voted
STOC
2010
ACM
15 years 5 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...