Here we ask the question about what "efficient" computation should be, as well as give definitions of P (deterministic polynomial time) and NP (nondeterministic polynomial time).
If you like this content, please consider subscribing to my channel: [ Ссылка ]
▶SEND ME THEORY QUESTIONS◀
ryan.e.dougherty@icloud.com
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.
What is "efficient" computation? (P vs NP)
Теги
easy theoryp vs np problemp vs np numberphilep vs np explainedp vs np examplesp vs np explained simplyefficient computationpolynomial time reductionpolynomial time algorithmpolynomial time reduction examplep polynomialnondeterministic polynomial timenondeterministic polynomial algorithmp vs npp vs np problem explainedeasy theory turing machine
