Hardness of monadic second-order formulae over succinct graphs (Q6858374)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8159490
Language Label Description Also known as
default for all languages
No label defined
    English
    Hardness of monadic second-order formulae over succinct graphs
    scientific article; zbMATH DE number 8159490

      Statements

      Hardness of monadic second-order formulae over succinct graphs (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      13 February 2026
      0 references

      Identifiers