ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: J. A. De Loera Univ. of California at Davis, Davis, CA, USA
J. Lee IBM T.J. Watson Research Center, Yorktown Heights, CA, USA
P. N. Malkin Univ. of California at Davis, Davis, CA, USA
S. Margulies Univ. of California at Davis, Davis, CA, USA
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 28
· Citation Count: 0

Published in:
Cover Image
 
· Proceeding
ISSAC '08 Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-59593-904-3 doi>10.1145/1390768.1390797

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 © 2012 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