2233 search results - page 329 / 447 » On the Complexity of Theory Curbing |
FOCS
1999
IEEE
14 years 16 days ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
KBSE
1999
IEEE
14 years 15 days ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
FOCS
1998
IEEE
14 years 15 days ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
EPS
1998
Springer
14 years 14 days ago
1998
Springer
The Classical Iterated Prisoner's Dilemma (CIPD) is used to study the evolution of cooperation. We show, with a genetic approach, how basic ideas could be used in order to gen...
FOCS
1997
IEEE
14 years 13 days ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...