Search result for Np-completeness Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 10 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
Reductions and Completeness NP Question...
NP-Complete Problems
by Daniel Kane , Alexander S. Kulikov- 0.0
-
![]()
![]()
![]()
![]()
![]()
3 Weeks
Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques. Step into the area of more complex problems and learn advanced algorithms to help solve them. You will practice solving large instances of some of these problems despite their hardness using very efficient specialized software and algorithmic techniques including:...
$150
Algorithms: Design and Analysis, Part 2
by Tim Roughgarden- 0.0
-
![]()
![]()
![]()
![]()
![]()
6 Weeks
Welcome to the self paced course, Algorithms: Design and Analysis, Part 2! Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This course is an introduction to algorithms for learners with at least a little programming experience. The course concludes with a multiple-choice final....
$149
Algorithm Design and Analysis
by Sampath Kannan- 0.0
-
![]()
![]()
![]()
![]()
![]()
4 Weeks
Learn about the core principles of computer science: algorithmic thinking and computational problem solving. How do you optimally encode a text file? How do you find shortest paths in a map? How do you design a communication network? How do you route data in a network? What are the limits of efficient computation?...
$149
Introduction to Graduate Algorithms
by Eric Vigoda , Arpan Chakraborty- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 3 months
The design and analysis of algorithms form an essential basis for computer science. This course is useful for those who want to pursue advanced studies in computer science, as well as those who want to work as a software engineer. Learn advanced techniques for designing algorithms and apply them to hard computational problems....
Free
The Design and Analysis of Algorithm Masterclass [ 2019 ]
by Up Degree- 3.6
-
![]()
![]()
![]()
![]()
![]()
12.5 hours on-demand video
Asymptotic Notations, Recursion, Divide and Conquer, Dynamic Programming, Dijkstra's, Bellman Ford, Floyd Warshall Algorithm, Kruskal's Algorithm, Knapsack Problem, String Matching with Finite Automaton, Heap sort, Huffman Codes, n-Queens Algorithm, Rat in Maze, 0/1 Knapsack Problem, 15 Puzzle Problem, NP Completeness, Approximation Algorithms NP Completeness and Approximation Algorithms...
$16.99
Advanced Algorithms and Complexity
by Alexander S. Kulikov , Michael Levin , Daniel M Kane , Neil Rhodes- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 27 hours to complete
P and NP All of NP to Circuit SAT...
Related searches
Intro to Theoretical Computer Science
by Sebastian Wernicke , Sean Bennett , Sarah Norell- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 2 months
At the end of this course, you will have a solid understanding of theoretical computer science. This will not only allow you to recognize some of the most challenging algorithmic problems out there, but also give you powerful tools to deal with them in practice. Learn the basic concepts in theoretical computer science....
Free
Computer Science: Algorithms, Theory, and Machines
by Robert Sedgewick , Kevin Wayne- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 20 hours to complete
P and NP...
