Introduction
- Introduction
- Complexity classes
- Reducebillity
- P=NP
- Circuit satisfiability
- Boolean satisfiability problem
- 3 CNF SAT problem
- Clicque problem
- Vertex cover problem
- Hamiltonian cycle problem
- Traveling Salesman Problem
What you'll learn
- Complexity classes P, NP, NP hard and NP complete problem
- Circuit Satisfiability problem
- SAT problem
- 3 CNFS SAT problem
- Clique Problem
- Vertex Cover Problem
- Hamiltonian Cycle problem
- Traveling salesman problem
Description
Yes, computers are really fast.
They can solve complex problems within a matter of seconds.
But there are some problems that can't be solved by computer quickly, those problems are called hard problems.
Those problems remain as a hard problem since still, we are not able to develop an efficient algorithm to solve such problems.
Want to learn about such problems? Join this course.
The University of Sheffield
Other Courses
Mining Traffic for Omnichannel Growth (English subtitle)
Business、Entrepreneurship、Wealth、Making Money、Pain-point for SMEs、Traffic costs
Do It Yourself PLC Trainer
Project, Setup PLC Trainer with CODESYS and Arduino Uno Compatible Board
Free Course On ParrotOS Linux by TechLatest
"Unlocking the Power of ParrotOS: A Comprehensive Guide to Linux Security and Ethical Hacking"
Introduction to Foursquare for Business
Learn what Foursquare is all about and how you can make it work for your business.
Katalon Studio for Beginners: Working with Web Test Objects
Learn how to use Katalon Studio to create solid test objects for automated web testing, using Attribute, XPath, and CSS
About the instructors
- 4.03 Calificación
- 6232 Estudiantes
- 4 Cursos
Jithin Parakka
CTO and Cofounder @ Mapletechspace.com
Jithin Parakka is Professor and Head of the Department of Computer Science and Engineering, St. Thomas College of Engineering & Technology, Kerala, India. Jithin Parakka has many years of teaching experience and is very enthusiastic towards e-learning. His area of interest includes, Data structures, Algorithm design and analysis, Automata theory and Compiler design.
Student feedback
3.95
Course Rating
Reviews
Bijan Aryal
19-06-2023
nice. it was available in youtube for free as well didn't know.
H C
19-06-2023
bad english
Niousha Hashemi
19-06-2023
Very very fast! and not understandable