313 search results - page 8 / 63 » Solving Structured Polynomial Systems and Applications to Cr... |
178
click to vote
ASIACRYPT
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We provide a general framework for constructing identitybased and broadcast encryption systems. In particular, we construct a general encryption system called spatial enc...
144
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
167
click to vote
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
177
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
129
click to vote
SACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
We show that there is a very straightforward closed algebraic formula for the Rijndael block cipher. This formula is highly structured and far simpler then algebraic formulations o...