Computational Complexity and Property Testing
Oded Goldreich
Informasi Umum
Kode
21.21.3411
Klasifikasi
004 - Data processing, Computer science
Jenis
Buku - Elektronik (E-Book)
Subjek
Computer Science
No. Rak
Tel-U Gedung Manterawu Lantai 5 : Rak 1
Tel-U Purwokerto : Rak 1
Dilihat
97 kali
Informasi Lainnya
Abstraksi
This volume contains a collection of studies in the areas of complexity theory and property testing. The 21 pieces of scientific work included were conducted at different times, mostly during the last decade. Although most of these works have been cited in the literature, none of them was formally published before.
Within complexity theory the topics include constant-depth Boolean circuits, explicit construction of expander graphs, interactive proof systems, monotone formulae for majority, probabilistically checkable proofs (PCPs), pseudorandomness, worst-case to average-case reductions, and zero-knowledge proofs.
Within property testing the topics include distribution testing, linearity testing, lower bounds on the query complexity (of property testing), testing graph properties, and tolerant testing. A common theme in this collection is the interplay between randomness and computation.
Koleksi & Sirkulasi
Tersedia 1 dari total 1 Koleksi
Anda harus log in untuk mengakses flippingbook
Pengarang
| Nama | Oded Goldreich |
| Jenis | Perorangan |
| Penyunting | |
| Penerjemah |
Penerbit
| Nama | Springer |
| Kota | Switzerland |
| Tahun | 2020 |
Sirkulasi
| Harga sewa | IDR 0,00 |
| Denda harian | IDR 0,00 |
| Jenis | Non-Sirkulasi |
