Inductive counting certifies the number of vertices reachable within successively larger path-length bounds. Knowing the exact earlier count lets a logarithmic-space nondeterministic machine certify that no reachable predecessor has been omitted.

Ancestors (10)

  1. Immerman–Szelepcsényi theorem
  2. co-NL
  3. NL (complexity)
  4. Logarithmic space
  5. Space complexity
  6. Complexity class
  7. Computational complexity theory
  8. Theoretical computer science
  9. Computer science
  10. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version