Constructing a perfect matching is in random NC

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: R M Karp Computer Science Division, University of California at Berkeley
E Upfal Computer Science Department, Stanford University
A Wigderson IBM San Jose Research Laboratory
Published in:
· Proceeding
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Pages 22-32
ACM New York, NY, USA ©1985
table of contents ISBN:0-89791-151-2 doi>10.1145/22145.22148
Constructing a perfect matching is in random NC Published by ACM 1985 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 15
· Downloads (cumulative): 444
· Citation Count: 8


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