Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size
Computational Complexity - Switzerland
doi 10.1007/s00037-009-0278-0
Full Text
Open PDFAbstract
Available in full text
Date
November 6, 2009
Authors
Publisher
Springer Science and Business Media LLC