proof format updates using gfm
This commit is contained in:
@@ -161,7 +161,7 @@ $ISET(G,k)$ returns true if $G$ contains an independent set of size $\geq k$, a
|
||||
|
||||
Algorithm? NO! We think that this is a hard problem.
|
||||
|
||||
A lot of pQEDle have tried and could not find a poly-time solution
|
||||
A lot of people have tried and could not find a poly-time solution
|
||||
|
||||
### Example: Vertex Cover (VC)
|
||||
|
||||
|
||||
Reference in New Issue
Block a user