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

Johann A. Makowsky, Klaus Meer. On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale. In Peter Clote, Helmut Schwichtenberg, editors, Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings. Volume 1862 of Lecture Notes in Computer Science, pages 399-410, Springer, 2000. [doi]

Abstract

Abstract is missing.