"On the Complexity of Combinatorial and Metafinite Generating Functions of ..."

Johann A. Makowsky, Klaus Meer (2000)

> Home

Details and statistics

DOI: 10.1007/3-540-44622-2_27

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/csl/MakowskyM00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csl/MakowskyM00
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. CSL 2000: 399-410

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.