Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification

Research output: Contribution to journal › Article › peer-review

  • 1 Conference contribution

Search results

  • 2011

    Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification

    Artemenko, S. & Shaltiel, R., 2011, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Proceedings. p. 377-388 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6845 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review