1199 search results - page 229 / 240 » Parameterized Proof Complexity |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
ACISP
2006
Springer
14 years 1 months ago
2006
Springer
![On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions")
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
ICAC
2005
IEEE
14 years 1 months ago
2005
IEEE
When designing decentralised autonomic computing systems, a fundamental engineering issue is to assess systemwide behaviour. Such decentralised systems are characterised by the la...
QEST
2005
IEEE
14 years 1 months ago
2005
IEEE
Internet servers are developing into complex but central components in the information infrastructure and are accessed by an ever-increasing and diversified user population. As s...