Academic Journal
Proving Hard-Core Predicates Using List Decoding
| العنوان: | Proving Hard-Core Predicates Using List Decoding |
|---|---|
| المؤلفون: | Mathematisches Forschungsinstitut Oberwolfach, Adi Akavia |
| المساهمون: | The Pennsylvania State University CiteSeerX Archives |
| المصدر: | http://www.mfo.de/programme/schedule/2003/18/Report19_2003.pdf. |
| سنة النشر: | 2003 |
| المجموعة: | CiteSeerX |
| الوصف: | Complexity theory is concerned with the study of the intrinsic difficulty of computational tasks. It is a central field of theoretical computer science. The 15 th Oberwolfach Conference on Complexity Theory was organized by Joachim von zur Gathen (Paderborn), Oded Goldreich (Rehovot), and Claus Peter Schnorr (Frankfurt). The meeting consisted of five general sessions, and in addition special sessions on the following topics |
| نوع الوثيقة: | text |
| وصف الملف: | application/pdf |
| اللغة: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.5808; http://www.mfo.de/programme/schedule/2003/18/Report19_2003.pdf |
| الاتاحة: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.5808 http://www.mfo.de/programme/schedule/2003/18/Report19_2003.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: | edsbas.D79E5E7 |
| قاعدة البيانات: | BASE |
| الوصف غير متاح. |