350 search results - page 4 / 70 » Lower and upper bounds on obtaining history independence |
EUROCRYPT
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
MFCS
2004
Springer
14 years 14 days ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
ECCC
2002
13 years 7 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
MOC
2000
13 years 6 months ago
2000
Lower bounds for the condition numbers of the preconditioned systems are obtained for the Bramble-Pasciak-Schatz substructuring preconditioner and the Neumann-Neumann preconditione...