Theoremintro
Graph isomorphism is in NP
An isomorphism between two graphs is a polynomial-size certificate that can be checked in polynomial time.
An isomorphism between two graphs is a polynomial-size certificate that can be checked in polynomial time.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag GWMWS8 Edit this page History Report an error