Although there is a large literature on arithmetic circuits, the various models that are studied differ in some fundamental aspects. This sometimes has made it difficult to evaluate the impact of results proved using one notion of circuit, as it relates to other classes of circuits. Communication among different segments of the community has sometimes been slow, owing to these differences in definitions, and other differences in focus. Techniques developed in one community have not always been fully appreciated in the other community.
This workshop will bring together people working with algebraic methods and arithmetic circuits as they relate to diverse areas of theoretical computer science, including the complexity of propositional proof systems (propositional, algebraic, and others), algebraic and symbolic computation, complexity of computing over the reals and other fields (along with connections to the model theory of fields), and connections to Boolean circuit complexity and the study of complexity classes.
There will be no contributed talks. Limited support is available for invited partcipants.
This is part of a continuing series of joint DIMATIA-DIMACS workshops improving cooperation and collaboration between the two research centers.