4217 search results - page 60 / 844 » Computational indistinguishability logic |
FOCS
1994
IEEE
15 years 2 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
TCS
2008
14 years 9 months ago
2008
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
JCB
2008
14 years 9 months ago
2008
A centromere is a special region in the chromosome that plays a vital role during cell division. Every new chromosome created by a genome rearrangement event must have a centromer...
HCI
2009
14 years 7 months ago
2009
Learning disabilities are serious societal problems contributing to a loss of quality of life for affected individuals and their families. We hypothesized that the learning disabil...
ICITS
2009
14 years 7 months ago
2009
In this article, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computat...