Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
computational complexity
Metadata
Title
Derandomized Parallel Repetition via Structured PCPs
Authors
Irit Dinur
Or Meir
Publication date
01-06-2011
Publisher
SP Birkhäuser Verlag Basel
Published in
computational complexity / Issue 2/2011
Print ISSN: 1016-3328
Electronic ISSN: 1420-8954
DOI
https://doi.org/10.1007/s00037-011-0013-5

Other articles of this Issue 2/2011

computational complexity 2/2011 Go to the issue

OriginalPaper

Special Issue “Conference on Computational Complexity 2010” Guest Editor’s Foreword

OriginalPaper

The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions

OriginalPaper

Spectral Algorithms for Unique Games

OriginalPaper

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

OriginalPaper

On Matrix Rigidity and Locally Self-correctable Codes

Premium Partner

    Image Credits