Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems-Reference-Cited by-同舟云学术

Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems

Published:2011 Issue: Volume: Page:700-711
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Mengel Stefan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22006-7_59

Reference16 articles.

1. Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM 30(3), 479–513 (1983)

2. Ben-Or, M., Cleve, R.: Computing algebraic formulas using a constant number of registers. SIAM J. Comput. 21(1), 54–58 (1992)

3. Lecture Notes in Computer Science;H.L. Bodlaender,1989

4. Brent, R.P.: The complexity of multiple-precision arithmetic. In: Brent, R.P., Andersson, R.S. (eds.) The Complexity of Computational Problem Solving, pp. 126–165. Univ. of Queensland Press (1976)

5. Lecture Notes in Computer Science;I. Briquel,2009

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes;ACM Transactions on Computation Theory;2021-12-31

2. Variants of the Determinant Polynomial and the $$\textsf {VP}$$-Completeness;Computer Science – Theory and Applications;2021

3. Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes;Lecture Notes in Computer Science;2019

4. Some Complete and Intermediate Polynomials in Algebraic Complexity Theory;Theory of Computing Systems;2017-03-13

5. Some Complete and Intermediate Polynomials in Algebraic Complexity Theory;Computer Science – Theory and Applications;2016