Matching algorithmic bounds for finding a Brouwer fixed point

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Xi Chen Tsinghua University, Beijing, China
Xiaotie Deng City University of Hong Kong, Hong Kong, China
Published in:
Cover Image
 
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 55 Issue 3, July 2008
Article No. 13
ACM New York, NY, USA
table of contents doi>10.1145/1379759.1379761
Matching algorithmic bounds for finding a Brouwer fixed point Published by ACM 2008 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 50
· Downloads (cumulative): 552
· Citation Count: 3


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