"Lower Bounds on the Complexity of MSO_1 Model-Checking."

Robert Ganian et al. (2012)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2012.326

access: open

type: Conference or Workshop Paper

metadata version: 2019-09-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/GanianHLOR12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/GanianHLOR12
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS 2012: 326-337

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.