1450 search results - page 30 / 290 » On the Complexity of Hardness Amplification |
IV
2002
IEEE
14 years 18 days ago
2002
IEEE
Dynamic interactive visualisations (DIVs) are intended to help coordination and collaboration, through augmenting existing forms of synchronous communication (i.e. phones, face to...
COLING
1990
13 years 8 months ago
1990
Tense and aspect, together with mood and modality, usually form the entangled structure of a complex verb. They are often hard to translate by machines, because of both syntactic ...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
COCOON
2000
Springer
14 years 1 days ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
KR
2010
Springer
13 years 11 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...