Author:
De Loera J. A.,Lee J.,Malkin P. N.,Margulies S.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Algorithm Analysis Through Proof Complexity;Sailing Routes in the World of Computation;2018
3. Graph-Coloring Ideals;Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation;2015-06-24
4. Approximating amoebas and coamoebas by sums of squares;Mathematics of Computation;2014-03-06
5. Most Tensor Problems Are NP-Hard;Journal of the ACM;2013-11