1450 search results - page 9 / 290 » On the Complexity of Hardness Amplification |
110
Voted
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
FSTTCS
2004
Springer
15 years 7 months ago
2004
Springer
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
SSWMC
2004
15 years 3 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
57
Voted
CSL
1987
Springer
15 years 5 months ago
1987
Springer
85
Voted
INFORMATICALT
2000
15 years 1 months ago
2000
The accuracy of adaptive integration algorithms for solving stiff ODE is investigated. The analysis is done by comparing the discrete and exact amplification factors of the equatio...