1450 search results - page 11 / 290 » On the Complexity of Hardness Amplification |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...
ICFCA
2010
Springer
14 years 2 months ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
CHI
2011
ACM
12 years 11 months ago
2011
ACM
The study of creativity has received significant attention over the past century, with a recent increase in interest in collaborative, distributed creativity. We posit that creati...