Complexity of Partial Satisfaction

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: K. J. Lieberherr Department of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ and Swiss Federal Institute of Technology, Zurich, Switzerland
E. Specker Department of Mathematics, Swiss Federal Institute of Technology, ETH Zurich, Ch-8092 Zurich, Switzerland
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 28 Issue 2, April 1981
Pages 411-421
ACM New York, NY, USA
table of contents doi>10.1145/322248.322260
Complexity of Partial Satisfaction Published by ACM 1981 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 21
· Downloads (cumulative): 413
· Citation Count: 17


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