In the Vinony graph
Within Vinony's link graph, Immerman–Szelepcsényi theorem is referenced by 24 other articles, and connects out to NSPACE, descriptive complexity theory and International Standard Book Number.
It sits within the topics Mathematical theorems in theoretical computer science and Structural complexity theory.
Its subject is documented across 6 Wikipedia language editions.
Wikidata facts
- Instance of
- theorem
- Part of
- list of theorems
- Named after
- Róbert Szelepcsényi
Show 2 more facts
- proved by
- Róbert Szelepcsényi
- maintained by WikiProject
- WikiProject Mathematics
Sources (1)
via Wikidata · CC0
Connections
NSPACE
Entity
descriptive complexity theory
Entity
International Standard Book Number
Entity
digital object identifier
Entity
pseudocode
Entity
computational complexity theory
Entity
Semantic Scholar
Entity
Stephen Cook
Entity
directed graph
Entity
NP
Entity
time complexity
Entity
Handle System
Entity
complexity class
Entity
Mathematical Reviews
Entity
CiteSeerX
Entity
Gödel Prize
Entity
NL
Entity
linear bounded automaton
Entity
co-NP
Entity
Savitch's theorem
Entity