SIGN IN
SIGN UP
The cost of the missing bit: communication complexity with help
Full Text:
PDF
Buy this Article
Authors:
László Babai
Department of Computer Science, University of Chicago, 1100 East, 58th, Street, IL
Thomas P. Hayes
Department of Mathemntics, University of Chicago, 5734 S. University Avenue, Chicaco, IL
Peter G. Kimmel
Department of Computer Science, University of Chicago
Published in:
· Proceeding
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Pages 673-682
ACM
New York, NY
, USA
©1998
table of contents
ISBN:0-89791-962-9
doi>
10.1145/276698.276883
1998 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 239
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
computations in finite fields
models of computation
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder