Linearity and unprovability of set union problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Martin Loebl KAM MFF UK, Department of Applied Mathematics, Charles University, Malostranské nám. 25 11800 Prague
Jaroslav Nešetřil KAM MFF UK, Department of Applied Mathematics, Charles University, Malostranské nám. 25 11800 Prague
Published in:
· Proceeding
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Pages 360-366
ACM New York, NY, USA ©1988
table of contents ISBN:0-89791-264-0 doi>10.1145/62212.62247
Linearity and unprovability of set union problem Published by ACM 1988 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 9
· Downloads (cumulative): 207
· Citation Count: 2


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