1730 search results - page 73 / 346 » Algebra and Computation |
SACRYPT
2001
Springer
14 years 2 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...
FCT
2009
Springer
14 years 4 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
NDSS
1999
IEEE
14 years 2 months ago
1999
IEEE
Open networks allow users to communicate without any prior arrangements such as contractual agreement or organisation membership. However, the very nature of open networks makes a...
SIAMCOMP
2000
13 years 9 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
CIRA
2007
IEEE
14 years 4 months ago
2007
IEEE
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...