Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits

标题
Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits
作者
关键词
Dichotomy theorems, Gröbner bases, Computer algebra, #CSP, Polynomial ideals
出版物
JOURNAL OF SYMBOLIC COMPUTATION
Volume 74, Issue -, Pages 152-180
出版商
Elsevier BV
发表日期
2015-06-20
DOI
10.1016/j.jsc.2015.06.008

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started