Immerman–Szelepcsényi theorem
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
logarithmic space
nondeterministic space complexity |
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Immerman–Szelepcsényi theorem
|
| gptkbp:implies |
NL = co-NL
|
| gptkbp:namedAfter |
gptkb:Neil_Immerman
Róbert Szelepcsényi |
| gptkbp:provenBy |
gptkb:Neil_Immerman
Róbert Szelepcsényi |
| gptkbp:publishedIn |
gptkb:Journal_of_Computer_and_System_Sciences
|
| gptkbp:relatedTo |
gptkb:Savitch's_theorem
NL-completeness |
| gptkbp:state |
nondeterministic space complexity classes are closed under complementation
|
| gptkbp:yearProved |
1987
|
| gptkbp:bfsParent |
gptkb:Neil_Immerman
|
| gptkbp:bfsLayer |
6
|