1007 search results - page 47 / 202 » The Complexity of Futile Questioning |
ASIACRYPT
1991
Springer
14 years 1 months ago
1991
Springer
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
CIE
2008
Springer
13 years 11 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
IJRR
2010
13 years 8 months ago
2010
This paper explores a topological perspective of planning in the presence of uncertainty, focusing on tasks specified by goal states in discrete spaces. The paper introduces stra...
SSS
2007
Springer
14 years 3 months ago
2007
Springer
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms, and presented three such algorithms for the problem of mutual exclusion on a ring of processors. The thir...
ISSRE
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract—As smart phones grow in popularity, manufacturers are in a race to pack an increasingly rich set of features into these tiny devices. This brings additional complexity i...