Sciweavers

406 search results - page 49 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
DM
2002
155views more  DM 2002»
13 years 10 months ago
Balanced nested designs and balanced arrays
Balanced nested designs are closely related to other combinatorial structures such as balanced arrays and balanced n-ary designs. In particular, the existence of symmetric balance...
Ryoh Fuji-Hara, Sanpei Kageyama, Shinya Kuriki, Yi...
ECCC
2002
103views more  ECCC 2002»
13 years 10 months ago
Monotone complexity and the rank of matrices
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...
Pavel Pudlák
TSMC
2002
142views more  TSMC 2002»
13 years 10 months ago
Dynamics of local search heuristics for the traveling salesman problem
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...
Weiqi Li, Bahram Alidaee
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
14 years 3 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
ASIACRYPT
2003
Springer
14 years 4 months ago
Sequential Key Derivation Patterns for Broadcast Encryption and Key Predistribution Schemes
Abstract. We study two closely related primitives: Broadcast Encryption and Key Predistribution Schemes (KPS). Broadcast Encryption allows a broadcaster to broadcast an encrypted m...
Nuttapong Attrapadung, Kazukuni Kobara, Hideki Ima...