NeuroCOLT

Neural Networks and Computational Learning Theory

About NeuroCOLT

Papers Archive

Books

info@neurocolt.org

NeuroCOLT Technical Report NC-TR-02-125

2002-125
On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale

JA Makowsky and Klaus Meer

ABSTRACT

We present a unified framework for the study of
the complexity of counting functions and multivariate polynomials
such as the permanent and the hamiltonian
in the computational model of Blum, Shub and Smale.

Download Postscript