For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
11
views
0
references
 Top references
cited by
1
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      4,431
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Conference Proceedings: not found

      Probabilistically checkable proofs with low amortized query complexity

      proceedings-article
      Author(s): ,
      Publication date:
      Publisher: IEEE Comput. Soc
      Conference name: 39th Annual Symposium on Foundations of Computer Science (SFCS-98)
      Conference date: 8-11 Nov. 1998

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Author and article information

          Conference
          Publisher: IEEE Comput. Soc
          Publication date: 1998
          Pages: 18-27
          Article
          DOI: 10.1109/SFCS.1998.743425
          SO-VID: eae6908a-3b8c-40cb-b391-e89c31a24e6f
          Conference name: 39th Annual Symposium on Foundations of Computer Science
          Conference acronym: SFCS-98
          Conference location: Palo Alto, CA, USA
          Conference date: 8-11 Nov. 1998
          History

          ScienceOpen disciplines: Quantitative & Systems biology,Biophysics
          Data availability:
          ScienceOpen disciplines: Quantitative & Systems biology, Biophysics

          Comments

          Comment on this article