Applications in Complexity Theory and Cryptography
Algorithms developed for list decoding of several interesting code families have found interesting applications in computational complexity and the field of cryptography. Following is a sample list of applications outside of coding theory:
- Construction of hard-core predicates from one-way permutations.
- Predicting witnesses for NP-search problems.
- Amplifying hardness of Boolean functions.
- Average case hardness of permanent of random matrices.
- Extractors and Pseudorandom generators.
- Efficient traitor tracing.
Read more about this topic: List Decoding
Famous quotes containing the words complexity and/or theory:
“It is not only their own need to mother that takes some women by surprise; there is also the shock of discovering the complexity of alternative child-care arrangements that have been made to sound so simple. Those for whom the intended solution is equal parenting have found that some parents are more equal than others.”
—Elaine Heffner (20th century)
“It makes no sense to say what the objects of a theory are,
beyond saying how to interpret or reinterpret that theory in another.”
—Willard Van Orman Quine (b. 1908)