Proceedings of the Eighth Annual Structure in Complexity Theory Conference

R Fagin, L. S., & Vardi, M. Y. (1993). Proceedings of the Eighth Annual Structure in Complexity Theory Conference.

Type

Unclassified

Intellectual base

Unclassified

Year

1993

DOI

10.1109/sct.1993.336544

Link

https://doi.org/10.1109/sct.1993.336544

Cited by

1 citation across 1 artifact.

Domain-specific

• Monadic second-order logic
  • … a convenient observable transfers from MSO can state that a graph is three-colorable by quantifying three vertex sets that partition vertices and contain no adjacent pair. to A result states MSO1 versus MSO2, full versus weak semantics and the structure class before invoking an automata or Courcelle-style theorem..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:017bbe70b542 · see in the full table