PPT-Locally Testable Codes and Expanders
Tali Kaufman Joint work with Irit Dinur Codes as CSPs A constraint satisfaction problem CSP is a sequence of constraints over variables f 1 x 1 x 2 x 5 f 2 x 5 x
Download Presentation
"Locally Testable Codes and Expanders" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.