Reductions do not preserve fast convergence rates in average time

DOI10.1007/PL00009267zbMath0936.68053OpenAlexW2944830574MaRDI QIDQ1283684

K. Appert

Publication date: 18 May 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009267

zbMATH Keywords

hierarchy theoremaverage-time complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Complete distributional problems, hard languages, and resource-bounded measure

This page was built for publication: Reductions do not preserve fast convergence rates in average time