Home » Computer Science and Engineering » Computer Science Fundamentals » Theoretical Foundations » 복잡도 클래스(Complexity Classes) » Classes of Complexity Classes » 비결정론적 다항 시간(Non-deterministic Polynomial Time, NP)

Problems of NP Time