Characterizing arithmetic circuit classes by constraint satisfaction problems

Stefan Mengel

ICALP'11: Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I（2011）

引用 1|浏览12

暂无评分

摘要

We explore the expressivity of constraint satisfaction problems (CSPs) in the arithmetic circuit model. While CSPs are known to yield VNP-complete polynomials in the general case, we show that for different restrictions of the structure of the CSPs we get characterizations of different arithmetic circuit classes. In particular we give the first natural non-circuit characterization of VP, the class of polynomial families efficiently computable by arithmetic circuits.

查看译文

关键词

arithmetic circuit,arithmetic circuit model,different arithmetic circuit class,different restriction,VNP-complete polynomial,constraint satisfaction problem,general case,natural non-circuit characterization,polynomial family,Characterizing arithmetic circuit class

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要