Descriptive Complexity Of Nl

Descriptive Complexity of NL is a theoretical framework in computational complexity theory that characterizes the expressive power of logical languages in capturing the complexity class NL (nondeterministic logarithmic space) through finite model theory.

1

Publications

11

Citations

1

Authors

1

Institutions

Publications per year

2017–2026

0

Authors

1

  1. AK
    Antonina Kolokolova

    Memorial University of Newfoundland, Canada

    1 publications · 11 citations

    1

    h-index

1–1 of 1

Institutions

1

  1. University of Toronto

    Toronto, Canada

    1 h-index

    1 publications

    11 citations

1–1 of 1

Venues

  1. Medical Entomology and Zoology

    1 publications · 11 citations

    1

    h-index

1–1