---
title: "SAT is in NP"
type: concept
related: [Non Polynomial Time]
source: https://www.jemoka.com/posts/kbhsat_is_in_np/
confidence: high
status: active
---

Recall SAT is in NP because if \(\phi \in \text{SAT}\), then there is a short (poly-n space), efficiently (poly-time) checkable proof (by just reading out the satisfying assignment).
