The Complexity of Symmetric Boolean Parity Holant Problems

标题
The Complexity of Symmetric Boolean Parity Holant Problems
作者
关键词
-
出版物
SIAM JOURNAL ON COMPUTING
Volume 42, Issue 1, Pages 324-356
出版商
Society for Industrial & Applied Mathematics (SIAM)
发表日期
2013-02-15
DOI
10.1137/100815530

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

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

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