Holographic Algorithm with Matchgates Is Universal for Planar #CSP over Boolean Domain

标题
Holographic Algorithm with Matchgates Is Universal for Planar #CSP over Boolean Domain
作者
关键词
-
出版物
SIAM JOURNAL ON COMPUTING
Volume -, Issue -, Pages STOC17-50-STOC17-151
出版商
Society for Industrial & Applied Mathematics (SIAM)
发表日期
2019-11-06
DOI
10.1137/17m1131672

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

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started

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