"Space and circuit complexity of monadic second-order definable problemes ..."

Michael Elberfeld (2013)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2021-07-17

- view
  - electronic edition @ uni-luebeck.de
  - electronic edition @ nbn-resolving.org
  authority control:
- export record
  dblp key:
  - phd/dnb/Elberfeld13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/dnb/Elberfeld13
Michael Elberfeld:
Space and circuit complexity of monadic second-order definable problemes on tree-decomposable structures. University of Lübeck, 2013

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.