SIGN IN
SIGN UP
Resolution lower bounds for the weak pigeonhole principle
Full Text:
Pdf
Buy this Article
Author:
Ran Raz
Weizmann Institute, Rehovot, Israel
Published in:
· Proceeding
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pages 553 - 562
ACM
New York, NY
, USA
©2002
table of contents
ISBN:1-58113-495-9
doi>
10.1145/509907.509987
2002 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Downloads (cumulative): 215
· Citation Count: 9
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
boundary value problems
experimentation
numerical algorithms
performance
resolution
theory
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