Checking computations in polylogarithmic time

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: László Babai Univ. of Chicago and Eötvoö Univ., Budapest
Lance Fortnow Dept. Comp. Sci., Univ. of Chicago, 1100 E 58th St, Chicago IL
Leonid A. Levin Dept. Comp. Sci., Boston University, 111 cummington St., Boston MA
Mario Szegedy Dept. Comp. Sci., Univ. of Chicago, 1100 E 58th St, Chicago IL
Checking computations in polylogarithmic time Published by ACM 1991 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 47
· Downloads (cumulative): 567
· Citation Count: 116

Published in:
· Proceeding
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Pages 21-32
ACM New York, NY, USA ©1991
table of contents ISBN:0-89791-397-3 doi>10.1145/103418.103428

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder