Author:
Ananth Prabhanjan,Dukkipati Ambedkar
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Alon, N.: Combinatorial Nullstellensatz. Combinatorics, Probability and Computing 8(1&2), 7–29 (1999)
2. Lovász, L.: Stable sets and polynomials. Discrete Mathematics 124(1-3), 137–153 (1994)
3. De Loera, J.: Gröbner bases and graph colorings. Beiträge Algebra Geom. 36(1), 89–96 (1995)
4. De Loera, J., Lee, J., Malkin, P., Margulies, S.: Hilbert’s Nullstellensatz and an algorithm for proving combinatorial infeasibility. In: ISSAC 2008: Proceedings of the Twenty-first International Symposium on Symbolic and Algebraic Computation, pp. 197–206. ACM (2008)
5. Margulies, S.: Computer algebra, combinatorics, and complexity: Hilberts Nullstellensatz and NP-complete problems. PhD thesis, University of California (2008)