↓ Skip to main content
What is this page? Embed badge

Randomization and Approximation Techniques in Computer Science

Overview of attention for book
Cover of 'Randomization and Approximation Techniques in Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
  3. Altmetric Badge
    Chapter 2 Average-case complexity of shortest-paths problems in the vertex-potential model
  4. Altmetric Badge
    Chapter 3 Approximation algorithms for covering polygons with squares and similar problems
  5. Altmetric Badge
    Chapter 4 Greedily approximating the r -independent set and k -center problems on random instances
  6. Altmetric Badge
    Chapter 5 Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
  7. Altmetric Badge
    Chapter 6 Random sampling of Euler tours
  8. Altmetric Badge
    Chapter 7 A combinatorial consistency lemma with application to proving the PCP theorem
  9. Altmetric Badge
    Chapter 8 Super-bits, demi-bits, and NP/qpoly-natural proofs
  10. Altmetric Badge
    Chapter 9 Sample spaces with small bias on neighborhoods and error-correcting communication protocols
  11. Altmetric Badge
    Chapter 10 Approximation on the web: A compendium of NP optimization problems
  12. Altmetric Badge
    Chapter 11 Random-based scheduling new approximations and LP lower bounds
  13. Altmetric Badge
    Chapter 12 ‘Go with the winners’ generators with applications to molecular modeling
  14. Altmetric Badge
    Chapter 13 Probabilistic approximation of some NP optimization problems by finite-state machines
  15. Altmetric Badge
    Chapter 14 Using hard problems to derandomize algorithms: An incomplete survey
  16. Altmetric Badge
    Chapter 15 Weak and strong recognition by 2-way randomized automata
  17. Altmetric Badge
    Chapter 16 Tally languages accepted by Monte Carlo pushdown automata
  18. Altmetric Badge
    Chapter 17 Resource-bounded randomness and compressibility with respect to nonuniform measures
  19. Altmetric Badge
    Chapter 18 Randomness, stochasticity and approximations
Attention for Chapter 14: Using hard problems to derandomize algorithms: An incomplete survey
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 Mendeley
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Using hard problems to derandomize algorithms: An incomplete survey
Chapter number 14
Book title
Randomization and Approximation Techniques in Computer Science
Published by
Springer, Berlin, Heidelberg, July 1997
DOI 10.1007/3-540-63248-4_14
Book ISBNs
978-3-54-063248-1, 978-3-54-069247-8
Authors

Russell Impagliazzo

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 100%
Readers by discipline Count As %
Mathematics 1 100%

This page is provided by Altmetric.